mlsanityData to 7 Oct 2026

The Effect of Mini-Batch Noise on the Implicit Bias of Adam

arXiv 2602.01642 ↗First posted 2 Feb 2026cs.LG cs.AI math.OCcited by 4

Not on the map. Why?

Abstract (arXiv)

With limited high-quality data and growing compute, multi-epoch training is gaining back its importance across sub-areas of deep learning. Adam(W), versions of which are go-to optimizers for many tasks such as next token prediction, has two momentum hyperparameters (β1, β2) controlling memory and one very important hyperparameter, batch size, controlling (in particular) the amount mini-batch noise. We introduce a theoretical framework to understand how mini-batch noise influences the implicit bias of memory in Adam (depending on β1, β2) towards sharper or flatter regions of the loss landscape, which is commonly observed to correlate with the generalization gap in multi-epoch training. We find that in the case of large batch sizes, higher β2 increases the magnitude of anti-regularization by memory (hurting generalization), but as the batch size becomes smaller, the dependence of (anti-)regulariation on β2 is reversed. A similar monotonicity shift (in the opposite direction) happens in β1. In particular, the commonly "default" pair (β1, β2) = (0.9, 0.999) is a good choice if batches are small; for larger batches, in many settings moving β1 closer to β2 is much better in terms of validation accuracy in multi-epoch training. Moreover, our theoretical derivations connect the scale of the batch size at which the shift happens to the scale of the critical batch size. We illustrate this effect in experiments with small-scale data in the about-to-overfit regime.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 77 of its 90 references that are in the map. First posted on arXiv 2 Feb 2026.

Builds on

77 of 90 references.

References · 77

  1. 2014Adam: A Method for Stochastic Optimizationcited by 36,960
  2. 2020Language Models are Few-Shot Learnerscited by 32,199
  3. 2024The Llama 3 Herd of Modelscited by 14,192
  4. 2023Llama 2: Open Foundation and Fine-Tuned Chat Modelscited by 12,865
  5. 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
  6. 2016Pointer Sentinel Mixture Modelscited by 2,992
  7. 2019Transformer-XL: Attentive Language Models Beyond a Fixed-Length Contextcited by 1,830
  8. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,734
  9. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  10. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  11. 2023PaLM 2 Technical Reportcited by 1,154
  12. 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 896
38 more
  1. 2022GLM-130B: An Open Bilingual Pre-trained Modelcited by 837
  2. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  3. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  4. 2017Sharp Minima Can Generalize For Deep Netscited by 462
  5. 2024DataComp-LM: In search of the next generation of training sets for language modelscited by 381
  6. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
  7. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  8. 2018An Empirical Model of Large-Batch Trainingcited by 268
  9. 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
  10. 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
  11. 2021On the Origin of Implicit Regularization in Stochastic Gradient Descentcited by 183
  12. 2018Gradient descent aligns the layers of deep linear networkscited by 182
  13. 2020Directional convergence and alignment in deep learningcited by 172
  14. 2020Implicit Gradient Regularizationcited by 145
  15. 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
  16. 2022Understanding Gradient Descent on Edge of Stability in Deep Learningcited by 126
  17. 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
  18. 2021Label Noise SGD Provably Prefers Flat Global Minimizerscited by 121
  19. 2020Descending through a Crowded Valley - Benchmarking Deep Learning Optimizerscited by 118
  20. 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
  21. 2018Three Mechanisms of Weight Decay Regularizationcited by 112
  22. 2018Convergence of Gradient Descent on Separable Datacited by 108
  23. 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 100
  24. 2022Sharpness-Aware Training for Freecited by 95
  25. 2023A Modern Look at the Relationship between Sharpness and Generalizationcited by 91
  26. 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 87
  27. 2022Fisher SAM: Information Geometry and Sharpness Aware Minimisationcited by 84
  28. 2024Resolving Discrepancies in Compute-Optimal Scaling of Language Modelscited by 84
  29. 2018Risk and parameter convergence of logistic regressioncited by 81
  30. 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
  31. 2023Why Do We Need Weight Decay in Modern Deep Learning?cited by 70
  32. 2024How Does Critical Batch Size Scale in Pre-training?cited by 68
  33. 2018Stochastic Gradient Descent on Separable Data: Exact Convergence with a Fixed Learning Ratecited by 63
  34. 2019Normalized Flat Minima: Exploring Scale Invariant Definition of Flat Minima for Neural Networks using PAC-Bayesian Analysiscited by 58
  35. 2025Overtrained Language Models Are Harder to Fine-Tunecited by 57
  36. 2024Implicit Bias of AdamW: ℓ_∞ Norm Constrained Optimizationcited by 54
  37. 2019Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Modelscited by 53
  38. 2024Friendly Sharpness-Aware Minimizationcited by 52

50 most cited of 77 All 77 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.