Reservoir computing for forecasting large spatiotemporal dynamical systems
From MaRDI portal
Publication:2231906
DOI10.1007/978-981-13-1687-6_6zbMath1482.68203OpenAlexW3192915838MaRDI QIDQ2231906
Publication date: 30 September 2021
Full work available at URL: https://doi.org/10.1007/978-981-13-1687-6_6
recurrent neural networksmachine learningspatiotemporal chaosreservoir computingdata-driven modelsecho state networks
Learning and adaptive systems in artificial intelligence (68T05) Strange attractors, chaotic dynamics of systems with hyperbolic behavior (37D45) Networks and circuits as models of computation; circuit complexity (68Q06)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Computation of multiple global optima through chaotic ant swarm
- Recent approaches to global optimization problems through particle Swarm optimization
- A filled function method for finding a global minimizer of a function of several variables
- A new constructing auxiliary function method for global optimization
- A class of filled functions for finding global minimizers of a function of several variables
- Computing Nash equilibria through computational intelligence methods
- Objective function stretching to alleviate convergence to local minima.
- An efficient algorithm for large scale global optimization of continuous functions
- A reduction method for semi-infinite programming by means of a global stochastic approach†
- On the alleviation of the problem of local minima in back-propagation
- The combination stretching function technique with simulated annealing algorithm for global optimization
- Constrained Multi-global Optimization using a Penalty Stretched Simulated Annealing Framework
This page was built for publication: Reservoir computing for forecasting large spatiotemporal dynamical systems