Precise Dynamics of Diagonal Linear Networks: A Unifying Analysis by Dynamical Mean-Field Theory
Not on the map. Why?
Abstract (arXiv)
Diagonal linear networks (DLNs) are a tractable model that captures several nontrivial behaviors in neural network training, such as initialization-dependent solutions and incremental learning. These phenomena are typically studied in isolation, leaving the overall dynamics insufficiently understood. In this work, we present a unified analysis of various phenomena in the gradient flow dynamics of DLNs. Using Dynamical Mean-Field Theory (DMFT), we derive a low-dimensional effective process that captures the asymptotic gradient flow dynamics in high dimensions. Analyzing this effective process yields new insights into DLN dynamics, including loss convergence rates and their trade-off with generalization, and systematically reproduces many of the previously observed phenomena. These findings deepen our understanding of DLNs and demonstrate the effectiveness of the DMFT approach in analyzing high-dimensional learning dynamics of neural networks.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 36 of its 59 references that are in the map. First posted on arXiv 2 Oct 2025.
Builds on
36 of 59 references.
References · 36
- 2020Scaling Laws for Neural Language Modelscited by 6,586
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 655
- 2022Grokking: Generalization Beyond Overfitting on Small Algorithmic Datasetscited by 629
- 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 513
- 2019The generalization error of random features regression: Precise asymptotics and double descent curvecited by 413
- 2019Implicit Regularization in Deep Matrix Factorizationcited by 405
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 342
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 306
- 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
24 more
- 2021Deep learning: a statistical viewpointcited by 240
- 2015Statistical physics of inference: Thresholds and algorithmscited by 128
- 2020Online stochastic gradient descent on non-convex losses from high-dimensional inferencecited by 119
- 2024A Dynamical Model of Neural Scaling Lawscited by 111
- 2021Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticitycited by 110
- 2023Grokking as the Transition from Lazy to Rich Training Dynamicscited by 108
- 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 105
- 2017Implicit Regularization in Deep Learningcited by 90
- 2020Shape Matters: Understanding the Implicit Bias of the Noise Covariancecited by 88
- 2019Implicit Regularization for Optimal Sparse Recoverycited by 80
- 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 80
- 2020Implicit Bias in Deep Linear Classification: Initialization Scale vs Training Accuracycited by 71
- 2021On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descentcited by 70
- 2020Dynamical mean-field theory for stochastic gradient descent in Gaussian mixture classificationcited by 60
- 2023Saddle-to-Saddle Dynamics in Diagonal Linear Networkscited by 57
- 2021A unifying tutorial on Approximate Message Passingcited by 50
- 2024Infinite Limits of Multi-head Transformer Dynamicscited by 39
- 2023(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stabilitycited by 36
- 2021Implicit Sparse Regularization: The Impact of Depth and Early Stoppingcited by 30
- 2022Incremental Learning in Diagonal Linear Networkscited by 28
- 2025Dynamical Decoupling of Generalization and Overfitting in Large Two-Layer Networkscited by 25
- 2018Marvels and Pitfalls of the Langevin Algorithm in Noisy High-dimensional Inferencecited by 24
- 2025Deep Linear Network Training Dynamics from Random Initialization: Data, Width, Depth, and Hyperparameter Transfercited by 19
- 2024Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networkscited by 9
Built on by
Citing papers per year: 2026: 2.
2 papers.