Sharpness-Aware Minimization: General Analysis and Improved Rates
Not on the map. Why?
Abstract (arXiv)
Sharpness-Aware Minimization (SAM) has emerged as a powerful method for improving generalization in machine learning models by minimizing the sharpness of the loss landscape. However, despite its success, several important questions regarding the convergence properties of SAM in non-convex settings are still open, including the benefits of using normalization in the update rule, the dependence of the analysis on the restrictive bounded variance assumption, and the convergence guarantees under different sampling strategies. To address these questions, in this paper, we provide a unified analysis of SAM and its unnormalized variant (USAM) under one single flexible update rule (Unified SAM), and we present convergence results of the new algorithm under a relaxed and more natural assumption on the stochastic noise. Our analysis provides convergence guarantees for SAM under different step size selections for non-convex problems and functions that satisfy the Polyak-Lojasiewicz (PL) condition (a non-convex generalization of strongly convex functions). The proposed theory holds under the arbitrary sampling paradigm, which includes importance sampling as special case, allowing us to analyze variants of SAM that were never explicitly considered in the literature. Experiments validate the theoretical findings and further demonstrate the practical effectiveness of Unified SAM in training deep neural networks for image classification tasks.
Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 39 of its 48 references that are in the map. First posted on arXiv 4 Mar 2025.
Builds on
39 of 48 references.
References · 39
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2016Wide Residual Networkscited by 3,070
- 2016Identity Mappings in Deep Residual Networkscited by 1,965
- 2016Understanding deep learning requires rethinking generalizationcited by 1,674
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,628
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,417
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2017Exploring Generalization in Deep Learningcited by 600
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 552
- 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 539
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
27 more
- 2019SGD: General Analysis and Improved Ratescited by 207
- 2020Bag of Tricks for Adversarial Trainingcited by 200
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 172
- 2020Better Theory for SGD in the Nonconvex Worldcited by 158
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2018Towards Understanding the Role of Over-Parametrization in Generalization of Neural Networkscited by 142
- 2020Regularizing Neural Networks via Adversarial Model Perturbationcited by 78
- 2022Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approachcited by 70
- 2020SGD for Structured Nonconvex Functions: Learning Rates, Minibatching and Interpolationcited by 67
- 2022The Dynamics of Sharpness-Aware Minimization: Bouncing Across Ravines and Drifting Towards Wide Minimacited by 51
- 2019Bad Global Minima Exist and SGD Can Reach Themcited by 49
- 2019Stochastic Gradient Descent for Nonconvex Learning without Bounded Gradient Assumptionscited by 48
- 2023Sharpness-Aware Minimization Leads to Low-Rank Featurescited by 38
- 2022Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methodscited by 37
- 2023Enhancing Sharpness-Aware Optimization Through Variance Suppressioncited by 37
- 2020Unified Analysis of Stochastic Gradient Methods for Composite Convex and Smooth Optimizationcited by 36
- 2020Stochastic Hamiltonian Gradient Methods for Smooth Gamescited by 32
- 2021Stochastic Extragradient: General Analysis and Improved Ratescited by 31
- 2023The Crucial Role of Normalization in Sharpness-Aware Minimizationcited by 26
- 2024On the Duality Between Sharpness-Aware Minimization and Adversarial Trainingcited by 24
- 2023Practical Sharpness-Aware Minimization Cannot Converge All the Way to Optimacited by 20
- 2023Single-Call Stochastic Extragradient Methods for Structured Non-monotone Variational Inequalities: Improved Analysis under Weaker Conditionscited by 14
- 2024Fundamental Convergence Analysis of Sharpness-Aware Minimizationcited by 14
- 2024A Universal Class of Sharpness-Aware Minimization Algorithmscited by 14
- 2024SAMPa: Sharpness-aware Minimization Parallelizedcited by 8
- 2025Avoiding spurious sharpness minimization broadens applicability of SAMcited by 8
- 2024Convergence of Sharpness-Aware Minimization Algorithms using Increasing Batch Size and Decaying Learning Ratecited by 1
Built on by
Citing papers per year: 2025: 5; 2026: 5.
10 papers.
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noisecited by 2
- 2026Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Schedulercited by 1
- 20265% > 100%: Flatness Preference is All You Need for Multimodal Parameter-Efficient Fine-Tuningcited by 1
- 2025DGSAM: Domain Generalization via Individual Sharpness-Aware Minimizationcited by 0
- 2025Sharpness-Aware Minimization with Z-Score Gradient Filteringcited by 0
- 2025Sharpness-Aware Minimization Can Hallucinate Minimizerscited by 0
- 2025Flatness-Aware Stochastic Gradient Langevin Dynamicscited by 0
- 2026X-SAM: Boosting Sharpness-Aware Minimization with Dominant-Eigenvector Gradient Correctioncited by 0
- 2026Leveraging Extragradient for Effective Sharpness-Aware Minimization in Deep Learningcited by 0
- 2026On the Implicit Flatness Bias of Sharpness-Aware Minimization: A Linear Stability Analysis with Quantitative Hyperparameter Boundscited by 0
- 2026On the Implicit Flatness Bias of Sharpness-Aware Minimization: A Linear Stability Analysis with Quantitative Hyperparameter Bounds4 Aug 2026
- 2026Leveraging Extragradient for Effective Sharpness-Aware Minimization in Deep Learning7 Jul 2026
- 20265% > 100%: Flatness Preference is All You Need for Multimodal Parameter-Efficient Fine-Tuning9 Jun 2026
- 2026Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler1 Jun 2026
- 2026X-SAM: Boosting Sharpness-Aware Minimization with Dominant-Eigenvector Gradient Correction15 Jan 2026
- 2025Flatness-Aware Stochastic Gradient Langevin Dynamics2 Oct 2025
- 2025Sharpness-Aware Minimization Can Hallucinate Minimizers26 Sep 2025
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noise22 Sep 2025
- 2025Sharpness-Aware Minimization with Z-Score Gradient Filtering5 May 2025
- 2025DGSAM: Domain Generalization via Individual Sharpness-Aware Minimization30 Mar 2025