Stability Analysis of Reservoir Computers Dynamics via Lyapunov Functions
arXiv:1908.04411 · doi:10.1063/1.5123733
Abstract
A Lyapunov design method is used to analyze the nonlinear stability of a generic reservoir computer for both the cases of continuous-time and discrete-time dynamics. Using this method, for a given nonlinear reservoir computer, a radial region of stability around a fixed point is analytically determined. We see that the training error of the reservoir computer is lower in the region where the analysis predicts global stability but is also affected by the particular choice of the individual dynamics for the reservoir systems. For the case that the dynamics is polynomial, it appears to be important for the polynomial to have nonzero coefficients corresponding to at least one odd power (e.g., linear term) and one even power (e.g., quadratic term).
References in corpus (9)
- Using Machine Learning to Replicate Chaotic Attractors and Calculate Lyapunov Exponents from Data
- Attractor Reconstruction by Machine Learning
- High performance photonic reservoir computer based on a coherently driven passive cavity
- Short-Term Memory in Orthogonal Neural Networks
- Using a reservoir computer to learn chaotic attractors, with applications to chaos synchronisation and cryptography
- Network Structure Effects in Reservoir Computers
- The difference between memory and prediction in linear recurrent networks
- Photonic Delay Systems as Machine Learning Implementations
- Mutual Information and the Edge of Chaos in Reservoir Computers