Back to the Continuous Attractor
Not on the map. Why?
Abstract (arXiv)
Continuous attractors offer a unique class of solutions for storing continuous-valued variables in recurrent system states for indefinitely long time intervals. Unfortunately, continuous attractors suffer from severe structural instability in general--they are destroyed by most infinitesimal changes of the dynamical law that defines them. This fragility limits their utility especially in biological systems as their recurrent dynamics are subject to constant perturbations. We observe that the bifurcations from continuous attractors in theoretical neuroscience models display various structurally stable forms. Although their asymptotic behaviors to maintain memory are categorically distinct, their finite-time behaviors are similar. We build on the persistent manifold theory to explain the commonalities between bifurcations from and approximations of continuous attractors. Fast-slow decomposition analysis uncovers the persistent manifold that survives the seemingly destructive bifurcation. Moreover, recurrent neural networks trained on analog memory tasks display approximate continuous attractors with predicted slow manifold structures. Therefore, continuous attractors are functionally robust and remain useful as a universal analogy for understanding analog memory.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 31 Jul 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 4; 2026: 2.
6 papers.
- 2025A ghost mechanism: An analytical model of abrupt learning in recurrent networkscited by 1
- 2025Dynamic Manifold Hopfield Networks for Context-Dependent Associative Memorycited by 0
- 2025Dynamical stability for dense patterns in attractor neural networkscited by 0
- 2025A Differential Manifold Perspective and Universality Analysis of Continuous Attractors in Artificial Neural Networkscited by 0
- 2026Robust Auto-associative Memory via Convolutional Restricted Hopfield Networkscited by 0
- 2026What Can a Recurrent State Safely Forget?cited by 0
- 2026What Can a Recurrent State Safely Forget?20 Sep 2026
- 2026Robust Auto-associative Memory via Convolutional Restricted Hopfield Networks11 Jun 2026
- 2025A Differential Manifold Perspective and Universality Analysis of Continuous Attractors in Artificial Neural Networks3 Sep 2025
- 2025Dynamical stability for dense patterns in attractor neural networks14 Jul 2025
- 2025Dynamic Manifold Hopfield Networks for Context-Dependent Associative Memory2 Jun 2025
- 2025A ghost mechanism: An analytical model of abrupt learning in recurrent networks4 Jan 2025