mlsanityData to 14 Oct 2026

Butterfly Effects of SGD Noise: Error Amplification in Behavior Cloning and Autoregression

arXiv 2310.11428 ↗First posted 17 Oct 2023cs.LG math.OC stat.MLcited by 14

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

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
  4. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  5. 2020Bootstrap your own latent: A new approach to self-supervised Learningcited by 4,750
  6. 2015Neural Machine Translation of Rare Words with Subword Unitscited by 2,918
  7. 2019The Curious Case of Neural Text Degenerationcited by 2,916
  8. 2023Diffusion Policy: Visuomotor Policy Learning via Action Diffusioncited by 2,838
  9. 2023Pythia: A Suite for Analyzing Large Language Models Across Training and Scalingcited by 1,786
  10. 2017Accurate, Large Minibatch SGD: Training ImageNet in 1 Hourcited by 1,492
  11. 2022Model soups: averaging weights of multiple fine-tuned models improves accuracy without increasing inference timecited by 1,396
  12. 2018Off-Policy Deep Reinforcement Learning without Explorationcited by 1,241
38 more
  1. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  2. 2017Visualizing the Loss Landscape of Neural Netscited by 1,130
  3. 2019Stabilizing Off-Policy Q-Learning via Bootstrapping Error Reductioncited by 840
  4. 2017Deep Reinforcement Learning that Matterscited by 754
  5. 2018On Lazy Training in Differentiable Programmingcited by 675
  6. 2021Offline Reinforcement Learning as One Big Sequence Modeling Problemcited by 644
  7. 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 637
  8. 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
  9. 2017End-to-end Driving via Conditional Imitation Learningcited by 485
  10. 2021Implicit Behavioral Cloningcited by 452
  11. 2023TinyStories: How Small Can Language Models Be and Still Speak Coherent English?cited by 449
  12. 2017Don't Decay the Learning Rate, Increase the Batch Sizecited by 320
  13. 2022Behavior Transformers: Cloning k modes with one stonecited by 304
  14. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 300
  15. 2016Contextual Decision Processes with Low Bellman Rank are PAC-Learnablecited by 292
  16. 2017How to Escape Saddle Points Efficientlycited by 285
  17. 2017Revisiting the Arcade Learning Environment: Evaluation Protocols and Open Problems for General Agentscited by 269
  18. 2018Global Convergence of Policy Gradient Methods for the Linear Quadratic Regulatorcited by 250
  19. 2021Bellman Eluder Dimension: New Rich Classes of RL Problems, and Sample-Efficient Algorithmscited by 223
  20. 2021The Statistical Complexity of Interactive Decision Makingcited by 218
  21. 2017DART: Noise Injection for Robust Imitation Learningcited by 191
  22. 2022Hidden Progress in Deep Learning: SGD Learns Parities Near the Computational Limitcited by 187
  23. 2021RvS: What is Essential for Offline RL via Supervised Learning?cited by 185
  24. 2021Bilinear Classes: A Structural Framework for Provable Generalization in RLcited by 178
  25. 2018A Study on Overfitting in Deep Reinforcement Learningcited by 174
  26. 2019Towards Explaining the Regularization Effect of Initial Large Learning Rate in Training Neural Networkscited by 162
  27. 2022Neural Networks can Learn Representations with Gradient Descentcited by 161
  28. 2018Learning Without Mixing: Towards A Sharp Analysis of Linear System Identificationcited by 158
  29. 2021Inductive Biases and Variable Creation in Self-Attention Mechanismscited by 144
  30. 2017Convergence Analysis of Two-layer Neural Networks with ReLU Activationcited by 137
  31. 2020What are the Statistical Limits of Offline RL with Linear Function Approximation?cited by 136
  32. 2018Assessing Generalization in Deep Reinforcement Learningcited by 133
  33. 2020Descending through a Crowded Valley - Benchmarking Deep Learning Optimizerscited by 119
  34. 2020Naive Exploration is Optimal for Online LQRcited by 116
  35. 2018Stochastic Modified Equations and Dynamics of Stochastic Gradient Algorithms I: Mathematical Foundationscited by 114
  36. 2022Why Exposure Bias Matters: An Imitation Learning Perspective of Error Accumulation in Language Generationcited by 108
  37. 2022On the SDEs and Scaling Rules for Adaptive Gradient Algorithmscited by 104
  38. 2018Tight Analyses for Non-Smooth Stochastic Gradient Descentcited by 97

50 most cited of 96 All 96 (JSON)

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 7; 2026: 3.

14 papers.

Sort:

By area: