This work uses error-free computation of two isomorphic chaotic systems, namely the Logistic map and the Tent map, to investigate the ability of Echo State Networks (ESNs) to learn and predict chaos, suggesting that ESNs exhibit significantly different predictive performance on the two isomorphic dynamical systems.
Abstract
We address the question of whether machine learning can improve the predictability of chaos. Due to the presence of chaos, chaotic time series are “contaminated” beyond the horizon of predictability as numerical errors accumulate. Therefore, evaluations should be based on error-free computation of chaos because learning the “contaminated” time series may not even be related to learning the chaotic dynamics. We use error-free computation of two isomorphic chaotic systems, namely the Logistic map and the Tent map, to investigate the ability of Echo State Networks (ESNs) to learn and predict chaos. ESNs exhibit significantly different predictive performance on the two isomorphic dynamical systems, suggesting that learning relies more on the arithmetic representation of the dynamical data than on the complexity or entropy production of the underlying dynamics. ESNs can achieve long horizons of predictability, but they do not improve the predictability of the corresponding dynamical models. Moreover, even when optimal predictive performance is achieved, this provides no guidance for other predictions within the same or its isomorphic dynamical system. The optimal hyperparameters depend strongly on the input time series and cannot be transferred, while increasing training length does not necessarily improve predictive performance.
Using ordinary least squares regression on high-degree polynomial features with 512-bit arithmetic, a system-agnostic method is introduced that matches the accuracy of standard 64-bit numerical ODE solvers using the systems’ governing equations, suggesting that forecasting low-dimensional chaotic systems from noise-fre...
It is demonstrated that the squared Pearson correlation coefficient provides a simple quantitative criterion for distinguishing chaos from noise directly from observed time-series data.
Multi-step training of sparse, interpretable models of dynamical systems directly from time-series data yields models with accurate short-term dynamics and strong agreement in long-time statistical properties, including mean, variance, and Lyapunov exponents.
This work demonstrates that the NMSE from an RC-based prediction model can be used as an indicator for system dynamical characterization, and provides an alternative approach for probing dynamical regimes from finite time series, paving the way for embedded neuromorphic tools dedicated to the experimental analysis of c...
Evrard Gabin Noutsa Tedjeuzen, Dagobert Wenkack Liedji, K. Lüdge et al.· AIP Advances· 0 citations
This is the first demonstration that a learned Hamiltonian can qualitatively extrapolate from predominantly regular dynamics into a broad chaotic sea absent from training, and what decides parameter extrapolation is not Hamiltonian structure alone but how the fitted Hamiltonian continues in the control parameter.
By analyzing the collective dynamics of the teacher-forced reservoir, this work finds that the target dynamics are represented mainly by stable Lyapunov modes whose finite-time stability is strongly modulated by the input, which motivates a stability-expressivity transfer index, which accurately identifies the optimal...
Yao Du, Xingang Wang· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.