Forgetting leads to chaos in attractor networks
Not on the map. Why?
Abstract (arXiv)
Attractor networks are an influential theory for memory storage in brain systems. This theory has recently been challenged by the observation of strong temporal variability in neuronal recordings during memory tasks. In this work, we study a sparsely connected attractor network where memories are learned according to a Hebbian synaptic plasticity rule. After recapitulating known results for the continuous, sparsely connected Hopfield model, we investigate a model in which new memories are learned continuously and old memories are forgotten, using an online synaptic plasticity rule. We show that for a forgetting time scale that optimizes storage capacity, the qualitative features of the network's memory retrieval dynamics are age-dependent: most recent memories are retrieved as fixed-point attractors while older memories are retrieved as chaotic attractors characterized by strong heterogeneity and temporal fluctuations. Therefore, fixed-point and chaotic attractors co-exist in the network phase space. The network presents a continuum of statistically distinguishable memory states, where chaotic fluctuations appear abruptly above a critical age and then increase gradually until the memory disappears. We develop a dynamical mean field theory (DMFT) to analyze the age-dependent dynamics and compare the theory with simulations of large networks. Our numerical simulations show that a high-degree of sparsity is necessary for the DMFT to accurately predict the network capacity. Finally, our theory provides specific predictions for delay response tasks with aging memoranda. Our theory of attractor networks that continuously learn new information at the price of forgetting old memories can account for the observed diversity of retrieval states in the cortex, and in particular the strong temporal fluctuations of cortical activity.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 30 Nov 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 1; 2024: 0; 2025: 2; 2026: 2.
5 papers.
- 2023Introduction to dynamical mean-field theory of randomly connected neural networks with bidirectionally correlated couplingscited by 6
- 2025Leveraging chaotic transients in the training of artificial neural networkscited by 3
- 2025Detecting Invariant Manifolds in ReLU-Based RNNscited by 3
- 2026A unified theory of feature learning in RNNs and DNNscited by 2
- 2026Basin Geometry and Reliable Recall of Dynamical Memories in Reservoir Computingcited by 0
- 2026Basin Geometry and Reliable Recall of Dynamical Memories in Reservoir Computing1 Sep 2026
- 2026A unified theory of feature learning in RNNs and DNNs17 Feb 2026
- 2025Detecting Invariant Manifolds in ReLU-Based RNNs4 Oct 2025
- 2025Leveraging chaotic transients in the training of artificial neural networks10 Jun 2025
- 2023Introduction to dynamical mean-field theory of randomly connected neural networks with bidirectionally correlated couplings15 May 2023