mlsanityData to 14 Oct 2026

Exponential weight averaging as damped harmonic motion

arXiv 2310.13854 ↗First posted 20 Oct 2023cs.LG math.OCcited by 0

Not on the map. Why?

Abstract (arXiv)

The exponential moving average (EMA) is a commonly used statistic for providing stable estimates of stochastic quantities in deep learning optimization. Recently, EMA has seen considerable use in generative models, where it is computed with respect to the model weights, and significantly improves the stability of the inference model during and after training. While the practice of weight averaging at the end of training is well-studied and known to improve estimates of local optima, the benefits of EMA over the course of training is less understood. In this paper, we derive an explicit connection between EMA and a damped harmonic system between two particles, where one particle (the EMA weights) is drawn to the other (the model weights) via an idealized zero-length spring. We then leverage this physical analogy to analyze the effectiveness of EMA, and propose an improved training algorithm, which we call BELAY. Finally, we demonstrate theoretically and empirically several advantages enjoyed by BELAY over standard EMA.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 28 references that are in the map. First posted on arXiv 20 Oct 2023.

Builds on

15 of 28 references.

References · 15

  1. 2020Denoising Diffusion Probabilistic Modelscited by 21,076
  2. 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
  3. 2022Elucidating the Design Space of Diffusion-Based Generative Modelscited by 3,045
  4. 2016Improved Techniques for Training GANscited by 2,970
  5. 2019Generating Long Sequences with Sparse Transformerscited by 1,546
  6. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
  7. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  8. 2014NICE: Non-linear Independent Components Estimationcited by 1,058
  9. 2020Improved Techniques for Training Score-Based Generative Modelscited by 1,043
  10. 2017PixelCNN++: Improving the PixelCNN with Discretized Logistic Mixture Likelihood and Other Modificationscited by 417
  11. 2019Sliced Score Matching: A Scalable Approach to Density and Score Estimationcited by 384
  12. 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 283
3 more
  1. 2019Flow++: Improving Flow-Based Generative Models with Variational Dequantization and Architecture Designcited by 262
  2. 2018The Unusual Effectiveness of Averaging in GAN Trainingcited by 73
  3. 2018WNGrad: Learn the Learning Rate in Gradient Descentcited by 24

Built on by

Not cited yet.