The lazy (NTK) and rich (μP) regimes: a gentle tutorial
Not on the map. Why?
Abstract (arXiv)
A central theme of the modern machine learning paradigm is that larger neural networks achieve better performance on a variety of metrics. Theoretical analyses of these overparameterized models have recently centered around studying very wide neural networks. In this tutorial, we provide a nonrigorous but illustrative derivation of the following fact: in order to train wide networks effectively, there is only one degree of freedom in choosing hyperparameters such as the learning rate and the size of the initial weights. This degree of freedom controls the richness of training behavior: at minimum, the wide network trains lazily like a kernel machine, and at maximum, it exhibits feature learning in the active μP regime. In this paper, we explain this richness scale, synthesize recent research results into a coherent whole, offer new perspectives and intuitions, and provide empirical evidence supporting our claims. In doing so, we hope to encourage further study of the richness scale, as it may be key to developing a scientific theory of feature learning in practical deep neural networks.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 23 references that are in the map. First posted on arXiv 30 Apr 2024.
Builds on
20 of 23 references.
References · 20
- 2016Wide Residual Networkscited by 3,070
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2018A Convergence Theory for Deep Learning via Over-Parameterizationcited by 787
- 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 738
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 574
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2019Mean-field theory of two-layers neural networks: dimension-free bounds and kernel limitcited by 187
- 2020Finite Versus Infinite Neural Networks: an Empirical Studycited by 157
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 143
- 2020On the linearity of large non-linear models: when and why the tangent kernel is constantcited by 129
8 more
- 2023A Spectral Condition for Feature Learningcited by 109
- 2022Self-Consistent Dynamical Field Theory of Kernel Evolution in Wide Neural Networkscited by 105
- 2019Dynamics of Deep Neural Networks and Neural Tangent Hierarchycited by 96
- 2020Neural Kernels Without Tangentscited by 56
- 2023Feature-Learning Networks Are Consistent Across Widths At Realistic Scalescited by 41
- 2021The Eigenlearning Framework: A Conservation Law Perspective on Kernel Regression and Wide Neural Networkscited by 26
- 2021A Theory of Neural Tangent Kernel Alignment and Its Influence on Trainingcited by 25
- 2023More is Better in Modern Machine Learning: when Infinite Overparameterization is Optimal and Overfitting is Obligatorycited by 18
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.