EMA Without the Lag: Bias-Corrected Iterate Averaging Schemes
Not on the map. Why?
Abstract (arXiv)
Stochasticity in language model fine-tuning, often caused by the small batch sizes typically used in this regime, can destabilize training by introducing large oscillations in generation quality. A popular approach to mitigating this instability is to take an Exponential moving average (EMA) of weights throughout training. While EMA reduces stochasticity, thereby smoothing training, the introduction of bias from old iterates often creates a lag in optimization relative to vanilla training. In this work, we propose the Bias-Corrected Exponential Moving Average (BEMA), a simple and practical augmentation of EMA that retains variance-reduction benefits while eliminating bias. BEMA is motivated by a simple theoretical model wherein we demonstrate provable acceleration of BEMA over both a standard EMA and vanilla training. Through an extensive suite of experiments on Language Models, we show that BEMA leads to significantly improved convergence rates and final performance over both EMA and vanilla training in a variety of standard LM benchmarks, making BEMA a practical and theoretically motivated intervention for more stable and efficient fine-tuning.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 48 of its 83 references that are in the map. First posted on arXiv 31 Jul 2025.
Builds on
48 of 83 references.
References · 48
- 2024The Llama 3 Herd of Modelscited by 14,715
- 2022Chain-of-Thought Prompting Elicits Reasoning in Large Language Modelscited by 12,459
- 2021Training Verifiers to Solve Math Word Problemscited by 10,109
- 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
- 2020Measuring Massive Multitask Language Understandingcited by 7,963
- 2023Efficient Memory Management for Large Language Model Serving with PagedAttentioncited by 5,944
- 2016SGDR: Stochastic Gradient Descent with Warm Restartscited by 5,045
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2017Deep reinforcement learning from human preferencescited by 3,912
- 2021Program Synthesis with Large Language Modelscited by 3,637
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
36 more
- 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
- 2024Qwen2 Technical Reportcited by 2,120
- 2019BioBERT: a pre-trained biomedical language representation model for biomedical text miningcited by 1,947
- 2025Gemma 3 Technical Reportcited by 1,824
- 2019SuperGLUE: A Stickier Benchmark for General-Purpose Language Understanding Systemscited by 1,729
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2024Tulu 3: Pushing Frontiers in Open Language Model Post-Trainingcited by 1,053
- 2021Gradient Descent on Neural Networks Typically Occurs at the Edge of Stabilitycited by 427
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2023Scaling Data-Constrained Language Modelscited by 403
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
- 2023Analyzing and Improving the Training Dynamics of Diffusion Modelscited by 402
- 2017Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysiscited by 243
- 2024SOAP: Improving and Stabilizing Shampoo using Adamcited by 192
- 2013Minimizing Finite Sums with the Stochastic Average Gradientcited by 164
- 2015Stochastic modified equations and adaptive stochastic gradient algorithmscited by 142
- 2022A Kernel-Based View of Language Model Fine-Tuningcited by 121
- 2019Which Algorithmic Choices Matter at Which Batch Sizes? Insights From a Noisy Quadratic Modelcited by 117
- 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 104
- 2018Revisiting Small Batch Training for Deep Neural Networkscited by 102
- 2024Is Behavior Cloning All You Need? Understanding Horizon in Imitation Learningcited by 74
- 2024How Does Critical Batch Size Scale in Pre-training?cited by 73
- 2022High-dimensional limit theorems for SGD: Effective dynamics and critical scalingcited by 70
- 2016Harder, Better, Faster, Stronger Convergence Rates for Least-Squares Regressioncited by 64
- 2022Stop Wasting My Time! Saving Days of ImageNet and BERT Training with Latest Weight Averagingcited by 54
- 2024The AdEMAMix Optimizer: Better, Faster, Oldercited by 54
- 2023Learning to Generate Better Than Your LLMcited by 49
- 2023Improving Large Language Model Fine-tuning for Solving Math Problemscited by 49
- 2023No Train No Gain: Revisiting Efficient Training Algorithms For Transformer-based Language Modelscited by 41
- 2023Provable Guarantees for Generative Behavior Cloning: Bridging Low-Level Stability and High-Level Behaviorcited by 33
- 2023How to Scale Your EMAcited by 24
- 2023Training trajectories, mini-batch losses and the curious role of the learning ratecited by 21
- 2023Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregressioncited by 14
- 2025Computational-Statistical Tradeoffs at the Next-Token Prediction Barrier: Autoregressive and Imitation Learning under Misspecificationcited by 13
- 2024Switch EMA: A Free Lunch for Better Flatness and Sharpnesscited by 9
- 2023Bidirectional Looking with A Novel Double Exponential Moving Average to Adaptive and Non-adaptive Momentum Optimizerscited by 6
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.