Time shifts to reduce the size of reservoir computers
From MaRDI portal
Publication:6567599
DOI10.1063/5.0097850MaRDI QIDQ6567599FDOQ6567599
Authors: T. L. Carroll, Joseph D. Hart
Publication date: 5 July 2024
Published in: Chaos (Search for Journal in Brave)
Approximation methods and numerical treatment of dynamical systems (37Mxx) Theory of computing (68Qxx) Dynamical systems with hyperbolic behavior (37Dxx)
Cites Work
- Principal component analysis.
- Title not available (Why is that?)
- Deterministic Nonperiodic Flow
- An equation for continuous chaos
- Fading memory and the problem of approximating nonlinear operators with Volterra series
- Fundamental aspects of noise in analog-hardware neural networks
- Embedding and approximation theorems for echo state networks
- Do reservoir computers work best at the edge of chaos?
- Breaking symmetries of the reservoir equations in echo state networks
- Delayed dynamical systems: networks, chimeras and reservoir computing
- Reservoir computing with random and optimized time-shifts
Cited In (2)
This page was built for publication: Time shifts to reduce the size of reservoir computers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567599)