mlsanityData to 7 Oct 2026

Stability Analysis of Sharpness-Aware Minimization

arXiv 2301.06308 ↗First posted 16 Jan 2023cs.LG cs.AIcited by 14

Not on the map. Why?

Abstract (arXiv)

Sharpness-aware minimization (SAM) is a training method that seeks to find flat minima in deep learning, resulting in state-of-the-art performance across various domains. Instead of minimizing the loss of the current weights, SAM minimizes the worst-case loss in its neighborhood in the parameter space. In this paper, we investigate the convergence instability of SAM near a saddle point. Using the qualitative theory of dynamical systems, we explain how SAM becomes stuck in the saddle point and theoretically prove that the saddle point can become an attractor under SAM dynamics. Additionally, we show that this convergence instability can also occur in stochastic dynamical systems by establishing the diffusion of SAM. We prove that SAM diffusion is worse than that of vanilla gradient descent in terms of saddle point escape. Finally, we demonstrate that often overlooked training tricks, momentum and batch-size, might be important to mitigate the convergence instability and achieve high generalization performance. Our theoretical and empirical results are thoroughly verified through experiments on several well-known optimization problems and benchmark tasks.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 21 of its 54 references that are in the map. First posted on arXiv 16 Jan 2023.

Builds on

21 of 54 references.

References · 21

  1. 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
  2. 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
  3. 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
  4. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  5. 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
  6. 2019Fantastic Generalization Measures and Where to Find Themcited by 507
  7. 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
  8. 2017Stochastic Gradient Descent as Approximate Bayesian Inferencecited by 298
  9. 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
  10. 2017Train longer, generalize better: closing the generalization gap in large batch training of neural networkscited by 278
  11. 2017Three Factors Influencing Minima in SGDcited by 270
  12. 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 259
9 more
  1. 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
  2. 2022Towards Understanding Sharpness-Aware Minimizationcited by 145
  3. 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
  4. 2018An Alternative View: When Does SGD Escape Local Minima?cited by 115
  5. 2022When Do Flat Minima Optimizers Work?cited by 78
  6. 2017Gradient Descent Can Take Exponential Time to Escape Saddle Pointscited by 74
  7. 2020Do We Need Zero Training Loss After Achieving Zero Training Error?cited by 61
  8. 2022The Dynamics of Sharpness-Aware Minimization: Bouncing Across Ravines and Drifting Towards Wide Minimacited by 51
  9. 2020Adaptive Inertia: Disentangling the Effects of Adaptive Learning Rate and Momentumcited by 40

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 6; 2024: 2; 2025: 4; 2026: 2.

14 papers.

Sort: