Good and bad predictions: assessing and improving the replication of chaotic attractors by means of reservoir computing
From MaRDI portal
(Redirected from Publication:4973018)
Abstract: The prediction of complex nonlinear dynamical systems with the help of machine learning techniques has become increasingly popular. In particular, reservoir computing turned out to be a very promising approach especially for the reproduction of the long-term properties of a nonlinear system. Yet, a thorough statistical analysis of the forecast results is missing. Using the Lorenz and R"ossler system we statistically analyze the quality of prediction for different parametrizations - both the exact short-term prediction as well as the reproduction of the long-term properties (the "climate") of the system as estimated by the correlation dimension and largest Lyapunov exponent. We find that both short and longterm predictions vary significantly among the realizations. Thus special care must be taken in selecting the good predictions as predictions which deliver better short-term prediction also tend to better resemble the long-term climate of the system. Instead of only using purely random Erd"os-Renyi networks we also investigate the benefit of alternative network topologies such as small world or scale-free networks and show which effect they have on the prediction quality. Our results suggest that the overall performance with respect to the reproduction of the climate of both the Lorenz and R"ossler system is worst for scale-free networks. For the Lorenz system there seems to be a slight benefit of using small world networks while for the R"ossler system small world and Erd"os -Renyi networks performed equivalently well. In general the observation is that reservoir computing works for all network topologies investigated here.
Recommendations
- Reducing network size and improving prediction stability of reservoir computing
- Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data
- On explaining the surprising success of reservoir computing forecaster of chaos? The universal machine learning dynamical system with contrast to VAR and DMD
- The architecture of dynamic reservoir in the echo state network
- Breaking symmetries of the reservoir equations in echo state networks
Cites work
- A practical method for calculating largest Lyapunov exponents from small data sets
- An equation for continuous chaos
- Collective dynamics of `small-world' networks
- Determining Lyapunov exponents from a time series
- Deterministic Nonperiodic Flow
- Directed scale-free graphs
- scientific article; zbMATH DE number 3150484 (Why is no real title available?)
- scientific article; zbMATH DE number 3967510 (Why is no real title available?)
- Measuring the strangeness of strange attractors
- Path length statistics in reservoir computers
- Real-Time Computing Without Stable States: A New Framework for Neural Computation Based on Perturbations
- Reservoir computing approaches to recurrent neural network training
- Ridge Regression: Biased Estimation for Nonorthogonal Problems
- Statistical mechanics of complex networks
- Testing for nonlinearity in time series: the method of surrogate data
- The architecture of dynamic reservoir in the echo state network
- Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data
Cited in
(25)- Robustness of LSTM neural networks for multi-step forecasting of chaotic time series
- Modeling chaotic systems: dynamical equations vs machine learning approach
- High-efficiency chaotic time series prediction based on time convolution neural network
- Using reservoir computer to predict and prevent extreme events
- Reservoir computing for forecasting large spatiotemporal dynamical systems
- Global optimization of hyper-parameters in reservoir computing
- Breaking symmetries of the reservoir equations in echo state networks
- Parameter extraction with reservoir computing: nonlinear time series analysis and application to industrial maintenance
- Using machine learning to replicate chaotic attractors and calculate Lyapunov exponents from data
- Transfer learning of chaotic systems
- On explaining the surprising success of reservoir computing forecaster of chaos? The universal machine learning dynamical system with contrast to VAR and DMD
- Symmetry kills the square in a multifunctional reservoir computer
- Reducing network size and improving prediction stability of reservoir computing
- Path length statistics in reservoir computers
- Proper choice of hyperparameters in reservoir computing of chaotic maps
- Robust optimization and validation of echo state networks for learning chaotic dynamics
- Efficient forecasting of chaotic systems with block-diagonal and binary reservoir computing
- Effect of temporal resolution on the reproduction of chaotic dynamics via reservoir computing
- Model-free inference of unseen attractors: reconstructing phase space features from a single noisy trajectory using Reservoir computing
- Reducing echo state network size with controllability matrices
- Selecting embedding delays: an overview of embedding techniques and a new method using persistent homology
- Large sampling intervals for learning and predicting chaotic systems with reservoir computing
- Data-driven performance measures using global properties of attractors for testing black-box surrogate models of chaotic systems
- Generic and isometric embeddings in reservoir computers
- Minimal deterministic echo state networks outperform random reservoirs in learning chaotic dynamics
This page was built for publication: Good and bad predictions: assessing and improving the replication of chaotic attractors by means of reservoir computing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4973018)
