Flexible task abstractions emerge in linear networks with fast and bounded units
Not on the map. Why?
Abstract (arXiv)
Animals survive in dynamic environments changing at arbitrary timescales, but such data distribution shifts are a challenge to neural networks. To adapt to change, neural systems may change a large number of parameters, which is a slow process involving forgetting past information. In contrast, animals leverage distribution changes to segment their stream of experience into tasks and associate them with internal task abstracts. Animals can then respond flexibly by selecting the appropriate task abstraction. However, how such flexible task abstractions may arise in neural systems remains unknown. Here, we analyze a linear gated network where the weights and gates are jointly optimized via gradient descent, but with neuron-like constraints on the gates including a faster timescale, nonnegativity, and bounded activity. We observe that the weights self-organize into modules specialized for tasks or sub-tasks encountered, while the gates layer forms unique representations that switch the appropriate weight modules (task abstractions). We analytically reduce the learning dynamics to an effective eigenspace, revealing a virtuous cycle: fast adapting gates drive weight specialization by protecting previous knowledge, while weight specialization in turn increases the update rate of the gating layer. Task switching in the gating layer accelerates as a function of curriculum block size and task training, mirroring key findings in cognitive neuroscience. We show that the discovered task abstractions support generalization through both task and subtask composition, and we extend our findings to a non-linear network switching between two tasks. Overall, our work offers a theory of cognitive flexibility in animals as arising from joint gradient descent on synaptic and neural gating in a neural network architecture.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 18 of its 48 references that are in the map. First posted on arXiv 6 Nov 2024.
Builds on
18 of 48 references.
References · 18
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2015Neural Module Networkscited by 376
- 2019Recurrent Independent Mechanismscited by 219
- 2018A mathematical theory of semantic development in deep neural networkscited by 186
- 2021Neural Networks as Kernel Learners: The Silent Alignment Effectcited by 106
- 2018Alleviating catastrophic forgetting using context-dependent gating and synaptic stabilizationcited by 104
- 2018Modular Networks: Learning to Decompose Neural Computationcited by 62
- 2020Learning to Combine Top-Down and Bottom-Up Signals in Recurrent Neural Networks with Attention over Modulescited by 38
- 2022The Neural Race Reduction: Dynamics of Abstraction in Gated Networkscited by 37
- 2022The Onset of Variance-Limited Behavior for Networks in the Lazy and Rich Regimescited by 25
6 more
- 2023Discovering modular solutions that generalize compositionallycited by 23
- 2023Improving Expert Specialization in Mixture of Expertscited by 17
- 2024Why Do Animals Need Shaping? A Theory of Task Composition and Curriculum Learningcited by 16
- 2018Learning, Planning, and Control in a Monolithic Neural Event Inference Architecturecited by 8
- 2022Thalamus: a brain-inspired algorithm for biologically-plausible continual learning and disentangled representationscited by 4
- 2024Gradient-based inference of abstract task representations for generalization in neural networkscited by 4
Built on by
Citing papers per year: 2025: 2.
2 papers.