Dimensionless Controls of Plasticity Under Alternating Tasks: From Evolutionary Biology to Continual Learning
Not on the map. Why?
Abstract (arXiv)
Plasticity under changing environments is central to both evolutionary biology and continual learning. Motivated by recent work on genotype--phenotype maps, we study a minimal deep-learning analogue where a network is trained alternately on two Boolean label sets, and ask which biological controls of plasticity survive the translation to gradient descent. Reinterpreting four proposed biological factors as quantities of training dynamics, we find the system reduces to two dimensionless controls: the task disagreement r, the fraction of disagreeing labels, and the reach η T, the product of learning rate and switching period. We derive two bounds on plasticity: r alone fixes an extremal geometric floor on the utopia distance, while r and η T jointly bound forgetting. Across 9,720 trajectories, an ANOVA confirms that r, η, and T dominate, while the effect of neutral-set size (emphasized in the biological setting) is negligible. The optimal reach itself follows an approximate inverse power law η T*propto r-1.18, yielding a heuristic that sets the optimal reach η T^* from the task disagreement alone. The analogy that survives is therefore dynamical rather than geometric, and our setting enables a view of plasticity through the lens of other driven systems in physics and engineering.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 19 of its 41 references that are in the map. First posted on arXiv 24 Aug 2026.
Builds on
19 of 41 references.
References · 19
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2020Gradient Surgery for Multi-Task Learningcited by 1,256
- 2018Experience Replay for Continual Learningcited by 1,095
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 588
- 2019Deep Ensembles: A Loss Landscape Perspectivecited by 443
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2024The Platonic Representation Hypothesiscited by 382
- 2020Linear Mode Connectivity in Multitask and Continual Learningcited by 145
- 2023Loss of Plasticity in Continual Deep Reinforcement Learningcited by 121
- 2020A Theoretical Analysis of Catastrophic Forgetting through the NTK Overlap Matrixcited by 103
- 2023Deep neural networks have an inbuilt Occam's razorcited by 28
- 2020Analysis of Stochastic Gradient Descent in Continuous Timecited by 24
7 more
- 2021Why flatness does and does not correlate with generalization for deep neural networkscited by 13
- 2024A PAC-Bayesian Link Between Generalisation and Flat Minimacited by 13
- 2024When Representations Align: Universality in Representation Learning Dynamicscited by 10
- 2025Commute Your Domains: Trajectory Optimality Criterion for Multi-Domain Learningcited by 9
- 2023Out-of-distribution forgetting: vulnerability of continual learning to intra-class distribution shiftcited by 3
- 2023On the curvature of the loss landscapecited by 3
- 2024Amplitude response and square wave describing functionscited by 1
Built on by
Not cited yet.