LightSAM: Parameter-Agnostic Sharpness-Aware Minimization
Not on the map. Why?
Abstract (arXiv)
Sharpness-Aware Minimization (SAM) optimizer enhances the generalization ability of the machine learning model by exploring the flat minima landscape through weight perturbations. Despite its empirical success, SAM introduces an additional hyper-parameter, the perturbation radius, which causes the sensitivity of SAM to it. Moreover, it has been proved that the perturbation radius and learning rate of SAM are constrained by problem-dependent parameters to guarantee convergence. These limitations indicate the requirement of parameter-tuning in practical applications. In this paper, we propose the algorithm LightSAM which sets the perturbation radius and learning rate of SAM adaptively, thus extending the application scope of SAM. LightSAM employs three popular adaptive optimizers, including AdaGrad-Norm, AdaGrad and Adam, to replace the SGD optimizer for weight perturbation and model updating, reducing sensitivity to parameters. Theoretical results show that under weak assumptions, LightSAM could converge ideally with any choices of perturbation radius and learning rate, thus achieving parameter-agnostic. We conduct preliminary experiments on several deep learning tasks, which together with the theoretical findings validate the the effectiveness of LightSAM.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 41 of its 54 references that are in the map. First posted on arXiv 30 May 2025.
Builds on
41 of 54 references.
References · 41
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,372
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,586
- 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
- 2019On the Convergence of Adam and Beyondcited by 841
- 2017Exploring Generalization in Deep Learningcited by 600
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2018AdaGrad stepsizes: Sharp convergence over nonconvex landscapescited by 182
- 2018On the Convergence of A Class of Adam-Type Algorithms for Non-Convex Optimizationcited by 174
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 172
- 2020A Simple Convergence Proof of Adam and Adagradcited by 171
29 more
- 2018On the Convergence of Stochastic Gradient Descent with Adaptive Stepsizescited by 156
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 146
- 2016Coin Betting and Parameter-Free Online Learningcited by 133
- 2018A Sufficient Condition for Convergences of Adam and RMSPropcited by 126
- 2022Adam Can Converge Without Any Modification On Update Rulescited by 114
- 2023Learning-Rate-Free Learning by D-Adaptationcited by 113
- 2018SGD and Hogwild! Convergence Without the Bounded Gradients Assumptioncited by 95
- 2022Sharpness-Aware Training for Freecited by 95
- 2018On the Convergence of Adaptive Gradient Methods for Nonconvex Optimizationcited by 91
- 2023DoG is SGD's Best Friend: A Parameter-Free Dynamic Step Size Schedulecited by 85
- 2022Robustness to Unbounded Smoothness of Generalized SignSGDcited by 81
- 2022Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approachcited by 70
- 2023Convergence of AdaGrad for Non-convex Objectives: Simple Proofs and Relaxed Assumptionscited by 57
- 2022Making SGD Parameter-Freecited by 50
- 2014Unconstrained Online Linear Learning in Hilbert Spaces: Minimax Algorithms and Normal Approximationscited by 46
- 2017Online to Offline Conversions, Universality and Adaptive Minibatch Sizescited by 39
- 2023Closing the Gap Between the Upper Bound and the Lower Bound of Adam's Iteration Complexitycited by 38
- 2017Online Learning Without Prior Informationcited by 36
- 2023DoWG Unleashed: An Efficient Universal Parameter-Free Gradient Descent Methodcited by 35
- 2023Parameter-Agnostic Optimization under Relaxed Smoothnesscited by 29
- 2014Simultaneous Model Selection and Optimization through Parameter-free Stochastic Learningcited by 27
- 2023The Crucial Role of Normalization in Sharpness-Aware Minimizationcited by 26
- 2023AdaSAM: Boosting Sharpness-Aware Minimization with Adaptive Learning Rate and Momentum for Training Deep Neural Networkscited by 21
- 2024Towards Quantifying the Preconditioning Effect of Adamcited by 19
- 2018A Unified Analysis of AdaGrad with Weighted Aggregation and Momentum Accelerationcited by 15
- 2024On the Convergence of Adam under Non-uniform Smoothness: Separability from SGDM and Beyondcited by 14
- 2024SAMPa: Sharpness-aware Minimization Parallelizedcited by 8
- 2024Towards Simple and Provable Parameter-Free Adaptive Gradient Methodscited by 2
- 2024Sharpness-Aware Minimization with Adaptive Regularization for Training Deep Neural Networkscited by 1
Built on by
Citing papers per year: 2025: 1; 2026: 2.
3 papers.