It's Not a Lottery, It's a Race: Understanding How Gradient Descent Adapts the Network's Capacity to the Task
Not on the map. Why?
Abstract (arXiv)
Our theoretical understanding of neural networks is lagging behind their empirical success. One of the important unexplained phenomena is why and how, during the process of training with gradient descent, the theoretical capacity of neural networks is reduced to an effective capacity that fits the task. We here investigate the mechanism by which gradient descent achieves this through analyzing the learning dynamics at the level of individual neurons in single hidden layer ReLU networks. We identify three dynamical principles, namely mutual alignment, unlocking and racing, that together explain why we can often successfully reduce capacity after training through the merging of equivalent neurons or the pruning of low norm weights. We specifically explain the mechanism behind the lottery ticket conjecture, or why the specific, beneficial initial conditions of some neurons lead them to obtain higher weight norms.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 33 of its 42 references that are in the map. First posted on arXiv 4 Feb 2026.
Builds on
33 of 42 references.
References · 33
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 467
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2018Gradient Descent Happens in a Tiny Subspacecited by 208
21 more
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
- 2020Proving the Lottery Ticket Hypothesis: Pruning is All You Needcited by 200
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2018A mathematical theory of semantic development in deep neural networkscited by 182
- 2020Directional convergence and alignment in deep learningcited by 172
- 2019Complexity of Linear Regions in Deep Networkscited by 166
- 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 122
- 2020The Early Phase of Neural Network Trainingcited by 114
- 2018Convergence of Gradient Descent on Separable Datacited by 108
- 2021Neural Networks as Kernel Learners: The Silent Alignment Effectcited by 106
- 2018On the Power of Over-parametrization in Neural Networks with Quadratic Activationcited by 102
- 2019One ticket to win them all: generalizing lottery ticket initializations across datasets and optimizerscited by 102
- 2022Neural networks trained with SGD learn distributions of increasing complexitycited by 50
- 2022Unmasking the Lottery Ticket Hypothesis: What's Encoded in a Winning Ticket's Mask?cited by 38
- 2022The Neural Race Reduction: Dynamics of Abstraction in Gated Networkscited by 37
- 2020Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecturecited by 23
- 2024A Survey of Lottery Ticket Hypothesiscited by 23
- 2018On the Learning Dynamics of Deep Neural Networkscited by 18
- 2023Linear CNNs Discover the Statistical Structure of the Dataset Using Only the Most Dominant Frequenciescited by 7
- 2025Make Haste Slowly: A Theory of Emergent Structured Mixed Selectivity in Feature Learning ReLU Networkscited by 2
- 2024On How Iterative Magnitude Pruning Discovers Local Receptive Fields in Fully Connected Neural Networkscited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.