Persistent learning signals and working memory without continuous attractors
Not on the map. Why?
Abstract (arXiv)
Neural dynamical systems with stable attractor structures, such as point attractors and continuous attractors, are hypothesized to underlie meaningful temporal behavior that requires working memory. However, working memory may not support useful learning signals necessary to adapt to changes in the temporal structure of the environment. We show that in addition to the continuous attractors that are widely implicated, periodic and quasi-periodic attractors can also support learning arbitrarily long temporal relationships. Unlike the continuous attractors that suffer from the fine-tuning problem, the less explored quasi-periodic attractors are uniquely qualified for learning to produce temporally structured behavior. Our theory has broad implications for the design of artificial learning systems and makes predictions about observable signatures of biological neural dynamics that can support temporal dependence learning and working memory. Based on our theory, we developed a new initialization scheme for artificial recurrent neural networks that outperforms standard methods for tasks that require learning temporal dynamics. Moreover, we propose a robust recurrent memory mechanism for integrating and maintaining head direction without a ring attractor.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 31 of its 132 references that are in the map. First posted on arXiv 24 Aug 2023.
Builds on
31 of 132 references.
References · 31
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
- 2013Exact solutions to the nonlinear dynamics of learning in deep linear neural networkscited by 748
- 2023Resurrecting Recurrent Neural Networks for Long Sequencescited by 397
- 2017Stable Architectures for Deep Neural Networkscited by 340
- 2015Unitary Evolution Recurrent Neural Networkscited by 291
- 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 183
- 2015Training Very Deep Networkscited by 172
- 2017Resurrecting the sigmoid in deep learning through dynamical isometry: theory and practicecited by 132
- 2019AntisymmetricRNN: A Dynamical System View on Recurrent Neural Networkscited by 112
19 more
- 2018How to Start Training: The Effect of Initialization and Architecturecited by 109
- 2020Lipschitz Recurrent Neural Networkscited by 88
- 2019ANODE: Unconditionally Accurate Memory-Efficient Gradients for Neural ODEscited by 83
- 2017On orthogonality and learning recurrent networks with long term dependenciescited by 82
- 2021On the difficulty of learning chaotic dynamics with RNNscited by 64
- 2021Attractor and integrator networks in the braincited by 60
- 2020Event-Based Backpropagation can compute Exact Gradients for Spiking Neural Networkscited by 59
- 2016Efficient Orthogonal Parametrisation of Recurrent Neural Networks Using Householder Reflectionscited by 56
- 2021UnICORNN: A recurrent model for learning very long time dependenciescited by 56
- 2017Gradient Descent for Spiking Neural Networkscited by 47
- 2018Dynamical Isometry and a Mean Field Theory of RNNs: Gating Enables Signal Propagation in Recurrent Neural Networkscited by 44
- 2019A Unified Framework of Online Learning Algorithms for Training Recurrent Neural Networkscited by 37
- 2020Lyapunov spectra of chaotic recurrent neural networkscited by 37
- 2020On Lyapunov Exponents for RNNs: Understanding Information Propagation Using Dynamical Systems Toolscited by 31
- 2019Robust computation with rhythmic spike patternscited by 21
- 2019Gated recurrent units viewed through the lens of continuous time dynamical systemscited by 18
- 2018Information Geometry of Orthogonal Initializations and Trainingcited by 7
- 2021Metastable dynamics of neural circuits and networkscited by 5
- 2015Symplectic Runge-Kutta schemes for adjoint equations, automatic differentiation, optimal control and morecited by 4
Built on by
Citing papers per year: 2023: 2; 2024: 2; 2025: 2.
6 papers.
- 2024Recurrent neural networks: vanishing and exploding gradients are not the end of the storycited by 25
- 2023Gradient Flossing: Improving Gradient Descent through Dynamic Control of Jacobianscited by 5
- 2024Neural timescales from a computational perspectivecited by 3
- 2023Phase codes emerge in recurrent neural networks optimized for modular arithmeticcited by 1
- 2025Improving World Models using Deep Supervision with Linear Probescited by 0
- 2025Memory Determines Learning Direction: A Theory of Gradient-Based Optimization in State Space Modelscited by 0
- 2025Memory Determines Learning Direction: A Theory of Gradient-Based Optimization in State Space Models1 Oct 2025
- 2025Improving World Models using Deep Supervision with Linear Probes4 Apr 2025
- 2024Neural timescales from a computational perspective4 Sep 2024
- 2024Recurrent neural networks: vanishing and exploding gradients are not the end of the story31 May 2024
- 2023Gradient Flossing: Improving Gradient Descent through Dynamic Control of Jacobians28 Dec 2023
- 2023Phase codes emerge in recurrent neural networks optimized for modular arithmetic11 Oct 2023