Basin Geometry and Reliable Recall of Dynamical Memories in Reservoir Computing
Not on the map. Why?
Abstract (arXiv)
Reliable attractor recall conventionally requires broad basins of attraction. However, in reservoir-computing based associative memory, temporal cues reliably recover dynamical memories despite basins dominated by unpredictable, riddled-like regions. We reveal that memory basins exhibit an ``octopus-like'' structure: a robust ``head'' near the attractor and thin, intertwined ``tentacles'' spanning state space. Initial states in tentacular regions yield near-zero uncertainty exponents, making the recalled memory effectively unpredictable at finite precision. Yet, cue-driven generalized synchronization bypasses this unpredictability, driving the system into the robust basin head. This mechanism yields a quantitative relation linking minimum cue duration, synchronization rate, and basin-head radius. Trained recurrent neural networks exhibit similar geometry, suggesting this phenomenon extends beyond reservoir computing.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 6 of its 37 references that are in the map. First posted on arXiv 1 Sep 2026.
Builds on
6 of 37 references.
References · 6
- 2020Machine learning prediction of critical transition and system collapsecited by 54
- 2018Interpreting recurrent neural networks behaviour via excitable network attractorscited by 15
- 2020Designing spontaneous behavioral switching via chaotic itinerancycited by 13
- 2017Balanced Excitation and Inhibition are Required for High-Capacity, Noise-Robust Neuronal Selectivitycited by 7
- 2022Exploring the limits of multifunctionality across different reservoir computerscited by 7
- 2021Forgetting leads to chaos in attractor networkscited by 5
Built on by
Not cited yet.