On the Stability of Growth in Structural Plasticity: Forward-Active yet Backward-Starved
Not on the map. Why?
Abstract (arXiv)
Standard deep-learning pipelines usually choose the network architecture before training and keep it fixed throughout optimization. In contrast, a model can also be adapted by editing its structure during training, for example by pruning existing hidden units or growing new ones; however, growth is not simply the inverse of pruning. Pruning selects among units trained from initialization, whereas growth inserts new capacity into an already specialized optimization trajectory. We isolate this insertion problem and show that newborn units can be forward-active yet backward-starved, receiving substantially weaker gradient signal than incumbent units. This asymmetry is weak in small MLPs but emerges in more challenging convolutional settings, where textscGrow reaches competitive final architectures despite weaker trajectory-level performance. Extending structural edits to residual networks reveals a strong dependence on edit location: head-localized growth produces concentrated but task-aligned representations and faster bounded label remapping, whereas growth throughout the residual hierarchy yields lower effective feature support, and a lower bounded adaptation endpoint. Interventions targeting optimizer state, insertion, selection, and trainability improve newborn integration, but not necessarily final subnetwork quality. Across continual-learning benchmarks, growth is most competitive when newborn units have sufficient time and trainability to integrate. Therefore, textscGrow should be evaluated not only by the architecture it ultimately discovers, but by whether late-arriving capacity becomes usable before a new structural change occurs during training.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 45 of its 68 references that are in the map. First posted on arXiv 14 May 2026.
Builds on
45 of 68 references.
References · 45
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2014ImageNet Large Scale Visual Recognition Challengecited by 8,441
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,718
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2016Progressive Neural Networkscited by 1,332
- 2020On Layer Normalization in the Transformer Architecturecited by 906
- 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 882
- 2019On the Convergence of Adam and Beyondcited by 834
- 2013An Empirical Investigation of Catastrophic Forgetting in Gradient-Based Neural Networkscited by 711
33 more
- 2017Lifelong Learning with Dynamically Expandable Networkscited by 689
- 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 671
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2017PathNet: Evolution Channels Gradient Descent in Super Neural Networkscited by 362
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 282
- 2020On the Stability of Fine-tuning BERT: Misconceptions, Explanations, and Strong Baselinescited by 254
- 2015Net2Net: Accelerating Learning via Knowledge Transfercited by 245
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2023Understanding plasticity in neural networkscited by 170
- 2017Deep Rewiring: Training very sparse deep networkscited by 136
- 2023Loss of Plasticity in Continual Deep Reinforcement Learningcited by 118
- 2017MorphNet: Fast & Simple Resource-Constrained Structure Learning of Deep Networkscited by 92
- 2025Nested Learning: The Illusion of Deep Learning Architecturescited by 69
- 2021Online Continual Learning with Natural Distribution Shifts: An Empirical Study with Visual Datacited by 67
- 2022GradMax: Growing Neural Networks using Gradient Informationcited by 64
- 2016Network Morphismcited by 63
- 2023Maintaining Plasticity in Continual Learning via Regenerative Regularizationcited by 63
- 2017NeST: A Neural Network Synthesis Tool Based on a Grow-and-Prune Paradigmcited by 60
- 2019Splitting Steepest Descent for Growing Neural Architecturescited by 52
- 2021Firefly Neural Architecture Descent: a General Approach for Growing Neural Networkscited by 48
- 2023Real-Time Evaluation in Online Continual Learning: A New Hopecited by 47
- 2023Dynamic Sparse Training with Structured Sparsitycited by 36
- 2023Online Continual Learning Without the Storage Constraintcited by 29
- 2023Resetting the Optimizer in Deep RL: An Empirical Studycited by 26
- 2024Plasticity Loss in Deep Reinforcement Learning: A Surveycited by 24
- 2017On the Robustness of Convolutional Neural Networks to Internal Architecture and Weight Perturbationscited by 14
- 2021GROWN: GRow Only When Necessary for Continual Learningcited by 11
- 2023Accelerated Training via Incrementally Growing Neural Networks using Variance Transfer and Learning Rate Adaptationcited by 8
- 2025Activation Function Design Sustains Plasticity in Continual Learningcited by 6
- 2016Neural networks with differentiable structurecited by 2
- 2024Overcoming Growth-Induced Forgetting in Task-Agnostic Continual Learningcited by 1
Built on by
Not cited yet.