Stability certificates for chains of delayed neural modules hold for any length
Length-Independent Stability and $L_2$-Gain Certificates for Chains of Delayed Neural Modules
Neural and Evolutionary Computing
Summary
When neural networks are built by linking many identical modules with delays in their connections, it can be hard to prove they will always behave stably no matter how many modules there are. The authors developed a way to test stability using a fixed-size mathematical check that applies to any length of such chains or rings of modules. Their method also provides guarantees about how signals amplify through the network, making it easier to certify large systems without growing complexity. This approach reduces the problem of certifying very long networks to checking a small, repeating unit, verified with exact math.
What this means in practice
- •For control systems engineers: Certify stability and signal amplification bounds of modular delayed control networks regardless of size using fixed-size mathematical checks.
- •For neural network architects: Validate large-scale neural networks built from repeating delayed modules for guaranteed stable behavior without analyzing each network size separately.
Authors
Ömer Faruk İşcanlı
Abstract
Networks of repeated neural modules with delayed neighbour coupling need stability guarantees for every number of modules, but delay-dependent criteria certify one network at a time and grow with its size. This paper derives stability and $L_2$-gain certificates of length-independent size for open chains and rings of modules of two alternating types with slope-restricted activations. A local and a transmission delay act independently and are only bounded and continuous. A Lyapunov-Krasovskii functional with fixed integration limits and module-local variables that repeat with the module type reduces the certificate of every chain to one cell of two modules. Local conditions and a single linear matrix inequality of order 96 on this cell, or 104 for the gain, certify global asymptotic stability and a common $L_2$-gain bound for all open chains and all rings with an even number of at least four modules. Up to a margin, the stability inequality is also necessary for the repeated variables to certify every length. All uniform certificates, including certified coupling regions, are verified in exact rational arithmetic. In the numerical study, the certified coupling reaches 92% of an outer bound given by unstable members of the model class for short delays and 79% at the nominal delay bounds. For 16 modules at unit coupling strength, certificates of the same functional computed for that length alone raise the certified delay scale by 2% to 7% in four cases. A single stability problem with 1298 scalar variables thus replaces per-length certification of long chains at little cost.