mlsanityData to 7 Oct 2026

Shape Matters: Understanding the Implicit Bias of the Noise Covariance

arXiv 2006.08680 ↗First posted 15 Jun 2020cs.LG stat.MLcited by 88

Not on the map. Why?

Abstract (arXiv)

The noise in stochastic gradient descent (SGD) provides a crucial implicit regularization effect for training overparameterized models. Prior theoretical work largely focuses on spherical Gaussian noise, whereas empirical studies demonstrate the phenomenon that parameter-dependent noise -- induced by mini-batches or label perturbation -- is far more effective than Gaussian noise. This paper theoretically characterizes this phenomenon on a quadratically-parameterized model introduced by Vaskevicius et el. and Woodworth et el. We show that in an over-parameterized setting, SGD with label noise recovers the sparse ground-truth with an arbitrary initialization, whereas SGD with Gaussian noise or gradient descent overfits to dense solutions with large norms. Our analysis reveals that parameter-dependent noise introduces a bias towards local minima with smaller noise variance, whereas spherical Gaussian noise does not. Code for our project is publicly available.

Key facts. Cited by 88 papers in the map (data through 7 Oct 2026). First posted on arXiv 15 Jun 2020.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 13; 2022: 22; 2023: 18; 2024: 12; 2025: 10; 2026: 13.

88 papers.

Sort:

  1. 2021Self-supervised Learning is More Robust to Dataset Imbalancecited by 122
  2. 2021Label Noise SGD Provably Prefers Flat Global Minimizerscited by 121
  3. 2022Modality Competition: What Makes Joint Training of Multi-modal Network Fail in Deep Learning? (Provably)cited by 115
  4. 2021Implicit Bias of SGD for Diagonal Linear Networks: a Provable Benefit of Stochasticitycited by 107
  5. 2021What Happens after SGD Reaches Zero Loss? --A Mathematical Frameworkcited by 106
  6. 2022Understanding the Generalization Benefit of Normalization Layers: Sharpness Reductioncited by 86
  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. 2023Dichotomy of Early and Late Phase Implicit Biases Can Provably Induce Grokkingcited by 76
  10. 2023Transformers as Support Vector Machinescited by 67
  11. 2022SGD with Large Step Sizes Learns Sparse Featurescited by 66
  12. 2022The alignment property of SGD noise and how it helps select flat minima: A stability analysiscited by 64
38 more
  1. 2021Stochastic Training is Not Necessary for Generalizationcited by 63
  2. 2023Max-Margin Token Selection in Attention Mechanismcited by 57
  3. 2023Saddle-to-Saddle Dynamics in Diagonal Linear Networkscited by 54
  4. 2022Anticorrelated Noise Injection for Improved Generalizationcited by 41
  5. 2022Towards understanding how momentum improves generalization in deep learningcited by 40
  6. 2021Strength of Minibatch Noise in SGDcited by 39
  7. 2023Sharpness Minimization Algorithms Do Not Only Minimize Sharpness To Achieve Better Generalizationcited by 39
  8. 2022Implicit Bias of Gradient Descent on Reparametrized Models: On Equivalence to Mirror Descentcited by 38
  9. 2023Stochastic Collapse: How Gradient Noise Attracts SGD Dynamics Towards Simpler Subnetworkscited by 38
  10. 2025Small Batch Size Training for Language Models: When Vanilla SGD Works, and Why Gradient Accumulation Is Wastefulcited by 36
  11. 2023Deep networks for system identification: a Surveycited by 35
  12. 2023(S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stabilitycited by 35
  13. 2023Revisiting the Noise Model of Stochastic Gradient Descentcited by 35
  14. 2024Why Do You Grok? A Theoretical Analysis of Grokking Modular Additioncited by 34
  15. 2023A Fast Optimization View: Reformulating Single Layer Attention in LLM Based on Tensor and SVM Trick, and Solving It in Matrix Multiplication Timecited by 30
  16. 2022Label noise (stochastic) gradient descent implicitly solves the Lasso for quadratic parametrisationcited by 29
  17. 2022Implicit Regularization in Hierarchical Tensor Factorization and Deep Convolutional Neural Networkscited by 27
  18. 2022Incremental Learning in Diagonal Linear Networkscited by 27
  19. 2021Stochasticity helps to navigate rough landscapes: comparing gradient-descent-based algorithms in the phase retrieval problemcited by 23
  20. 2024Implicit Regularization of Gradient Flow on One-Layer Softmax Attentioncited by 16
  21. 2021Noisy Gradient Descent Converges to Flat Minima for Nonconvex Matrix Factorizationcited by 15
  22. 2021Optimal Gradient-based Algorithms for Non-concave Bandit Optimizationcited by 15
  23. 2023How connectivity structure shapes rich and lazy learning in neural circuitscited by 15
  24. 2022On the Overlooked Structure of Stochastic Gradientscited by 13
  25. 2024Transformers Learn Low Sensitivity Functions: Investigations and Implicationscited by 13
  26. 2023mSAM: Micro-Batch-Averaged Sharpness-Aware Minimizationcited by 10
  27. 2021Going Beyond Linear RL: Sample Efficient Neural Function Approximationcited by 9
  28. 2023Dissecting the Effects of SGD Noise in Distinct Regimes of Deep Learningcited by 9
  29. 2023Beyond Implicit Bias: The Insignificance of SGD Noise in Online Learningcited by 9
  30. 2023Inductive biases of multi-task learning and finetuning: multiple regimes of feature reusecited by 9
  31. 2024Leveraging Continuous Time to Understand Momentum When Training Diagonal Linear Networkscited by 9
  32. 2021Why Do Local Methods Solve Nonconvex Problems?cited by 8
  33. 2023A Theoretical Analysis of Noise Geometry in Stochastic Gradient Descentcited by 8
  34. 2024How Neural Networks Learn the Support is an Implicit Regularization Effect of SGDcited by 8
  35. 2022Thinking Outside the Ball: Optimal Learning with Gradient Descent for Generalized Linear Stochastic Convex Optimizationcited by 7
  36. 2022Max-Margin Works while Large Margin Fails: Generalization without Uniform Convergencecited by 6
  37. 2024Understanding the Generalization Benefits of Late Learning Rate Decaycited by 6
  38. 2024The Optimality of (Accelerated) SGD for High-Dimensional Quadratic Optimizationcited by 6

50 most cited of 88 All 88 (JSON)