arXiv · 2611.22918
Reconstructing hidden attractors with reservoir computing
Abstract
Hidden attractors are difficult to locate as their basins of attraction do not intersect with any small neighborhood of an equilibrium point. We examine the possibility of reconstructing the hidden chaotic attractor from time series via reservoir computing, where the reservoir is built by a network of driven Kuramoto oscillators. We compare all-to-all coupling, nearest-neighbour ring coupling, and a ring with one modified oscillator equation which ensures that any attractor will be hidden. The numerical results suggest that ring coupling supports accurate reconstruction over a wider range of coupling and forcing strengths than all-to-all coupling. Searches near reservoir equilibria nevertheless show why agreement in short-term prediction and long-term statistics does not establish preservation of hiddenness. Numerics for the modified ring show that it has the highest performance which coincides with our intuition that reconstructing the global dynamics would yield a more faithful attractor reconstruction. We also show that this construction precludes global forgetting of initial conditions for constant inputs, although local conditional contraction along a nonconstant signal remains possible. The distinction between reconstructing attractor dynamics and preserving basin structure provides a basis for evaluating and designing reservoir models of hidden attractors.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Mohammad Zaman, Emel Khan, Thomas Geert de Jong. 2026-11-17. Reconstructing hidden attractors with reservoir computing. https://searcharxiv.com/abs/2611.22918
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.