mlsanityData to 7 Oct 2026

Kernel and Rich Regimes in Overparametrized Models

arXiv 2002.09277 ↗First posted 20 Feb 2020cs.LG stat.MLcited by 302

Not on the map. Why?

Abstract (arXiv)

A recent line of work studies overparametrized neural networks in the "kernel regime," i.e. when the network behaves during training as a kernelized linear predictor, and thus training with gradient descent has the effect of finding the minimum RKHS norm solution. This stands in contrast to other studies which demonstrate how gradient descent on overparametrized multilayer networks can induce rich implicit biases that are not RKHS norms. Building on an observation by Chizat and Bach, we show how the scale of the initialization controls the transition between the "kernel" (aka lazy) and "rich" (aka active) regimes and affects generalization properties in multilayer homogeneous models. We also highlight an interesting role for the width of a model in the case that the predictor is not identically zero at initialization. We provide a complete and detailed analysis for a family of simple depth-D models that already exhibit an interesting and meaningful transition between the kernel and rich regimes, and we also demonstrate this transition empirically for more complex matrix factorization models and multilayer non-linear networks.

Key facts. Cited by 302 papers in the map (data through 7 Oct 2026). First posted on arXiv 20 Feb 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 42; 2022: 56; 2023: 60; 2024: 54; 2025: 41; 2026: 49.

302 papers.

Sort:

By area:

  1. 2022Towards Understanding Grokking: An Effective Theory of Representation Learningcited by 229
  2. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  3. 2022High-dimensional Asymptotics of Feature Learning: How One Gradient Step Improves the Representationcited by 146
  4. 2022Towards Understanding Sharpness-Aware Minimizationcited by 145
  5. 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
  6. 2021Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolationcited by 130
  7. 2022Reconstructing Training Data from Trained Neural Networkscited by 129
  8. 2021Label Noise SGD Provably Prefers Flat Global Minimizerscited by 121
  9. 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
  10. 2022A Kernel-Based View of Language Model Fine-Tuningcited by 118
  11. 2022Modality Competition: What Makes Joint Training of Multi-modal Network Fail in Deep Learning? (Provably)cited by 115
  12. 2021Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticitycited by 107
38 more
  1. 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 106
  2. 2021Neural Networks as Kernel Learners: The Silent Alignment Effectcited by 106
  3. 2022Robust Training under Label Noise by Over-parameterizationcited by 93
  4. 2022Vision Transformers provably learn spatial structurecited by 92
  5. 2022Learning Single-Index Models with Shallow Neural Networkscited by 92
  6. 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 91
  7. 2022On the Implicit Bias in Deep-Learning Algorithmscited by 84
  8. 2022Same Pre-training Loss, Better Downstream: Implicit Bias Matters for Language Modelscited by 84
  9. 2021Saddle-to-Saddle Dynamics in Deep Linear Networks: Small Initialization Training, Symmetry, and Sparsitycited by 83
  10. 2021Gradient Descent on Two-layer Nets: Margin Maximization and Simplicity Biascited by 82
  11. 2021Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstructioncited by 77
  12. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
  13. 2022Gradient flow dynamics of shallow ReLU networks for square loss and orthogonal inputscited by 74
  14. 2021On the Implicit Bias of Initialization Shape: Beyond Infinitesimal Mirror Descentcited by 69
  15. 2023Transformers as Support Vector Machinescited by 67
  16. 2021DR3: Value-Based Deep Reinforcement Learning Requires Explicit Regularizationcited by 66
  17. 2022SGD with Large Step Sizes Learns Sparse Featurescited by 66
  18. 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
  19. 2023Max-Margin Token Selection in Attention Mechanismcited by 57
  20. 2024How Feature Learning Can Improve Neural Scaling Lawscited by 55
  21. 2021A Farewell to the Bias-Variance Tradeoff? An Overview of the Theory of Overparameterized Machine Learningcited by 54
  22. 2023Saddle-to-Saddle Dynamics in Diagonal Linear Networkscited by 54
  23. 2022Implicit Regularization Towards Rank Minimization in ReLU Networkscited by 53
  24. 2021Do Input Gradients Highlight Discriminative Features?cited by 52
  25. 2023Transformers learn through gradual rank increasecited by 52
  26. 2024From Lazy to Rich: Exact Learning Dynamics in Deep Linear Networkscited by 46
  27. 2024Trimming the Fat: Efficient Compression of 3D Gaussian Splats through Pruningcited by 45
  28. 2023The Implicit Regularization of Dynamical Stability in Stochastic Gradient Descentcited by 44
  29. 2025Training Dynamics of In-Context Learning in Linear Attentioncited by 44
  30. 2021Implicit Regularization in Tensor Factorizationcited by 43
  31. 2021Quantifying the Benefit of Using Differentiable Learning over Tangent Kernelscited by 41
  32. 2024Get rich quick: exact solutions reveal how unbalanced initializations promote rapid feature learningcited by 41
  33. 2023Understanding Incremental Learning of Gradient Descent: A Fine-grained Analysis of Matrix Sensingcited by 40
  34. 2023Sharpness Minimization Algorithms Do Not Only Minimize Sharpness To Achieve Better Generalizationcited by 39
  35. 2022Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descentcited by 38
  36. 2023Stochastic Collapse: How Gradient Noise Attracts SGD Dynamics Towards Simpler Subnetworkscited by 38
  37. 2023SGD Finds then Tunes Features in Two-Layer Neural Networks with near-Optimal Sample Complexity: A Case Study in the XOR problemcited by 36
  38. 2021On the Theory of Implicit Deep Learning: Global Convergence with Implicit Layerscited by 35

50 most cited of 302 All 302 (JSON)