Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression
Not on the map. Why?
Abstract (arXiv)
This work studies training instabilities of behavior cloning with deep neural networks. We observe that minibatch SGD updates to the policy network during training result in sharp oscillations in long-horizon rewards, despite negligibly affecting the behavior cloning loss. We empirically disentangle the statistical and computational causes of these oscillations, and find them to stem from the chaotic propagation of minibatch SGD noise through unstable closed-loop dynamics. While SGD noise is benign in the single-step action prediction objective, it results in catastrophic error accumulation over long horizons, an effect we term gradient variance amplification (GVA). We show that many standard mitigation techniques do not alleviate GVA, but find an exponential moving average (EMA) of iterates to be surprisingly effective at doing so. We illustrate the generality of this phenomenon by showing the existence of GVA and its amelioration by EMA in both continuous control and autoregressive language generation. Finally, we provide theoretical vignettes that highlight the benefits of EMA in alleviating GVA and shed light on the extent to which classical convex models can help in understanding the benefits of iterate averaging in deep learning.
Key facts. Cited by 14 papers in the map (data through 14 Oct 2026). Builds on 96 of its 141 references that are in the map. First posted on arXiv 17 Oct 2023.
Builds on
96 of 141 references.
References · 96
- 2017Attention Is All You Needcited by 60,361
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
- 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
- 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2023Diffusion Policy: Visuomotor Policy Learning via Action Diffusioncited by 2,838
- 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
- 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
- 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
- 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
38 more
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
- 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
- 2017Deep Reinforcement Learning that Matterscited by 754
- 2018On Lazy Training in Differentiable Programmingcited by 675
- 2021Offline Reinforcement Learning as One Big Sequence Modeling Problemcited by 644
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2017End-to-end Driving via Conditional Imitation Learningcited by 485
- 2021Implicit Behavioral Cloningcited by 452
- 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 449
- 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
- 2022Behavior Transformers: Cloning k modes with one stonecited by 304
- 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
- 2016Contextual Decision Processes with Low Bellman Rank are PAC-Learnablecited by 292
- 2017How to Escape Saddle Points Efficientlycited by 285
- 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 269
- 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 250
- 2021Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithmscited by 223
- 2021The Statistical Complexity of Interactive Decision Makingcited by 218
- 2017DART: Noise Injection for Robust Imitation Learningcited by 191
- 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 187
- 2021RvS: What is Essential for Offline RL via Supervised Learning?cited by 185
- 2021Bilinear Classes: A Structural Framework for Provable Generalization in RLcited by 178
- 2018A Study on Overfitting in Deep Reinforcement Learningcited by 174
- 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
- 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
- 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
- 2021Inductive Biases and Variable Creation in Self-Attention Mechanismscited by 144
- 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
- 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?cited by 136
- 2018Assessing Generalization in Deep Reinforcement Learningcited by 133
- 2020Descending through a Crowded Valley - Benchmarking Deep Learning Optimizerscited by 119
- 2020Naive Exploration is Optimal for Online LQRcited by 116
- 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 114
- 2022Why Exposure Bias Matters: An Imitation Learning Perspective of Error Accumulation in Language Generationcited by 108
- 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 104
- 2018Tight Analyses for Non-Smooth Stochastic Gradient Descentcited by 97
50 most cited of 96 All 96 (JSON)
Built on by
Citing papers per year: 2023: 1; 2024: 3; 2025: 7; 2026: 3.
14 papers.
Sort:
By area:
- 2023TinyGSM: achieving >80% on GSM8k with small language modelscited by 70
- 2025Much Ado About Noising: Dispelling the Myths of Generative Robotic Controlcited by 36
- 2025FOLDER: Accelerating Multi-modal Large Language Models with Enhanced Performancecited by 30
- 2025The Pitfalls of Imitation Learning when Actions are Continuouscited by 26
- 2024Adam with model exponential moving average is effective for nonconvex optimizationcited by 23
- 2025On the Query Complexity of Verifier-Assisted Language Generationcited by 12
- 2024Active Fine-Tuning of Multi-Task Policiescited by 9
- 2025EMA Without the Lag: Bias-Corrected Iterate Averaging Schemescited by 3
- 2025To Distill or Decide? Understanding the Algorithmic Trade-off in Partially Observable Reinforcement Learningcited by 3
- 2025Understanding SGD with Exponential Moving Average: A Case Study in Linear Regressioncited by 1
- 2026Training for the Model You Return: Improving Optimization for Iterate-Averaged Language Modelscited by 1
- 2024Problem Space Transformations for Out-of-Distribution Generalisation in Behavioural Cloningcited by 0
2 more
- 2026ReBRAC-v2: The Return of the King2 Aug 2026
- 2026Training for the Model You Return: Improving Optimization for Iterate-Averaged Language Models23 Jun 2026
- 2026Behavior Cloning Under PD Control: A Finite-Horizon Theory of Gain-Dependent Error Amplification15 Apr 2026
- 2025Much Ado About Noising: Dispelling the Myths of Generative Robotic Control1 Dec 2025
- 2025To Distill or Decide? Understanding the Algorithmic Trade-off in Partially Observable Reinforcement Learning3 Oct 2025
- 2025EMA Without the Lag: Bias-Corrected Iterate Averaging Schemes31 Jul 2025
- 2025The Pitfalls of Imitation Learning when Actions are Continuous12 Mar 2025
- 2025Understanding SGD with Exponential Moving Average: A Case Study in Linear Regression19 Feb 2025
- 2025On the Query Complexity of Verifier-Assisted Language Generation17 Feb 2025
- 2025FOLDER: Accelerating Multi-modal Large Language Models with Enhanced Performance5 Jan 2025
- 2024Problem Space Transformations for Out-of-Distribution Generalisation in Behavioural Cloning6 Nov 2024
- 2024Active Fine-Tuning of Multi-Task Policies7 Oct 2024
2 more
- 2025The Pitfalls of Imitation Learning when Actions are Continuouscited by 26
- 2024Active Fine-Tuning of Multi-Task Policiescited by 9
- 2024Problem Space Transformations for Out-of-Distribution Generalisation in Behavioural Cloningcited by 0
- 2026ReBRAC-v2: The Return of the Kingcited by 0
- 2026ReBRAC-v2: The Return of the King2 Aug 2026
- 2025The Pitfalls of Imitation Learning when Actions are Continuous12 Mar 2025
- 2024Problem Space Transformations for Out-of-Distribution Generalisation in Behavioural Cloning6 Nov 2024
- 2024Active Fine-Tuning of Multi-Task Policies7 Oct 2024
- 2025Much Ado About Noising: Dispelling the Myths of Generative Robotic Controlcited by 36
- 2024Adam with model exponential moving average is effective for nonconvex optimizationcited by 23
- 2025EMA Without the Lag: Bias-Corrected Iterate Averaging Schemescited by 3
- 2026Training for the Model You Return: Improving Optimization for Iterate-Averaged Language Modelscited by 1
- 2026Behavior Cloning Under PD Control: A Finite-Horizon Theory of Gain-Dependent Error Amplificationcited by 0
- 2026Training for the Model You Return: Improving Optimization for Iterate-Averaged Language Models23 Jun 2026
- 2026Behavior Cloning Under PD Control: A Finite-Horizon Theory of Gain-Dependent Error Amplification15 Apr 2026
- 2025Much Ado About Noising: Dispelling the Myths of Generative Robotic Control1 Dec 2025
- 2025EMA Without the Lag: Bias-Corrected Iterate Averaging Schemes31 Jul 2025
- 2024Adam with model exponential moving average is effective for nonconvex optimization28 May 2024