Avoiding spurious sharpness minimization broadens applicability of SAM
Not on the map. Why?
Abstract (arXiv)
Curvature regularization techniques like Sharpness Aware Minimization (SAM) have shown great promise in improving generalization on vision tasks. However, we find that SAM performs poorly in domains like natural language processing (NLP), often degrading performance -- even with twice the compute budget. We investigate the discrepancy across domains and find that in the NLP setting, SAM is dominated by regularization of the logit statistics -- instead of improving the geometry of the function itself. We use this observation to develop an alternative algorithm we call Functional-SAM, which regularizes curvature only through modification of the statistics of the overall function implemented by the neural network, and avoids spurious minimization through logit manipulation. Furthermore, we argue that preconditioning the SAM perturbation also prevents spurious minimization, and when combined with Functional-SAM, it gives further improvements. Our proposed algorithms show improved performance over AdamW and SAM baselines when trained for an equal number of steps, in both fixed-length and Chinchilla-style training settings, at various model scales (including billion-parameter scale). On the whole, our work highlights the importance of more precise characterizations of sharpness in broadening the applicability of curvature regularization to large language models (LLMs).
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 4 Feb 2025.
Builds on
0 of 0 references.
No references here yet.
Built on by
Citing papers per year: 2025: 3; 2026: 5.
8 papers.
- 2025Sharpness-Aware Minimization: General Analysis and Improved Ratescited by 10
- 2025Flat Minima and Generalization: Insights from Stochastic Convex Optimizationcited by 3
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noisecited by 2
- 2026Sharpness-Aware Minimization in Logit Space Efficiently Enhances Direct Preference Optimizationcited by 1
- 2026Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Schedulercited by 1
- 2026Sharpness-Aware Minimization and Muon: Robustness under the Spectral Normcited by 1
- 2026Data Distribution as a Lever for Guiding Optimizers Toward Superior Generalization in LLMscited by 0
- 2026Causal-Aware Foundation-Model for Bilevel Optimization in Discrete Choice Settingscited by 0
- 2026Sharpness-Aware Minimization and Muon: Robustness under the Spectral Norm28 Jul 2026
- 2026Adaptive Sharpness-Aware Minimization with a Polyak-type Step size: A Theory-Grounded Scheduler1 Jun 2026
- 2026Causal-Aware Foundation-Model for Bilevel Optimization in Discrete Choice Settings7 May 2026
- 2026Sharpness-Aware Minimization in Logit Space Efficiently Enhances Direct Preference Optimization18 Mar 2026
- 2026Data Distribution as a Lever for Guiding Optimizers Toward Superior Generalization in LLMs31 Jan 2026
- 2025Flat Minima and Generalization: Insights from Stochastic Convex Optimization5 Nov 2025
- 2025Unveiling m-Sharpness Through the Structure of Stochastic Gradient Noise22 Sep 2025
- 2025Sharpness-Aware Minimization: General Analysis and Improved Rates4 Mar 2025