Critical Influence of Overparameterization on Sharpness-aware Minimization
Not on the map. Why?
Abstract (arXiv)
Sharpness-Aware Minimization (SAM) has attracted considerable attention for its effectiveness in improving generalization in deep neural network training by explicitly minimizing sharpness in the loss landscape. Its success, however, relies on the assumption that there exists sufficient variability of flatness in the solution space-a condition commonly facilitated by overparameterization. Yet, the interaction between SAM and overparameterization has not been thoroughly investigated, leaving a gap in understanding precisely how overparameterization affects SAM. Thus, in this work, we analyze SAM under varying degrees of overparameterization, presenting both empirical and theoretical findings that reveal its critical influence on SAM's effectiveness. First, we conduct extensive numerical experiments across diverse domains, demonstrating that SAM consistently benefits from overparameterization. Next, we attribute this phenomenon to the interplay between the enlarged solution space and increased implicit bias resulting from overparameterization. Furthermore, we show that this effect is particularly pronounced in practical settings involving label noise and sparsity, and yet, sufficient regularization is necessary. Last but not least, we provide other theoretical insights into how overparameterization helps SAM achieve minima with more uniform Hessian moments compared to SGD, and much faster convergence at a linear rate.
Key facts. Cited by 3 papers in the map (data through 7 Oct 2026). Builds on 78 of its 103 references that are in the map. First posted on arXiv 29 Nov 2023.
Builds on
78 of 103 references.
References · 78
- 2017Attention Is All You Needcited by 59,932
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2022Training language models to follow instructions with human feedbackcited by 15,712
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2017Proximal Policy Optimization Algorithmscited by 14,441
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022Flamingo: a Visual Language Model for Few-Shot Learningcited by 4,337
- 2022LAION-5B: An open large-scale dataset for training next generation image-text modelscited by 4,131
- 2022Robust Speech Recognition via Large-Scale Weak Supervisioncited by 3,972
38 more
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2013Playing Atari with Deep Reinforcement Learningcited by 3,211
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2020Sharpness-Aware Minimization for Efficiently Improving Generalizationcited by 1,404
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
- 2018On Lazy Training in Differentiable Programmingcited by 671
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2017Exploring Generalization in Deep Learningcited by 595
- 2020Learning from Noisy Labels with Deep Neural Networks: A Surveycited by 580
- 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2016Linear Convergence of Gradient and Proximal-Gradient Methods Under the Polyak-Lojasiewicz Conditioncited by 526
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2021Differentially Private Fine-tuning of Language Modelscited by 392
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
- 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 259
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2016Deep Learning without Poor Local Minimacited by 233
- 2020Loss landscapes and optimization in over-parameterized non-linear systems and neural networkscited by 231
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 2018To understand deep learning we need to understand kernel learningcited by 186
- 2017The Power of Interpolation: Understanding the Effectiveness of SGD in Modern Over-parametrized Learningcited by 150
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 145
- 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
- 2018Fast and Faster Convergence of SGD for Over-Parameterized Models and an Accelerated Perceptroncited by 143
50 most cited of 78 All 78 (JSON)
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.