SASSHA: Sharpness-aware Adaptive Second-order Optimization with Stable Hessian Approximation
Not on the map. Why?
Abstract (arXiv)
Approximate second-order optimization methods often exhibit poorer generalization compared to first-order approaches. In this work, we look into this issue through the lens of the loss landscape and find that existing second-order methods tend to converge to sharper minima compared to SGD. In response, we propose Sassha, a novel second-order method designed to enhance generalization by explicitly reducing sharpness of the solution, while stabilizing the computation of approximate Hessians along the optimization trajectory. In fact, this sharpness minimization scheme is crafted also to accommodate lazy Hessian updates, so as to secure efficiency besides flatness. To validate its effectiveness, we conduct a wide range of standard deep learning experiments where Sassha demonstrates its outstanding generalization performance that is comparable to, and mostly better than, other methods. We provide a comprehensive set of analyses including convergence, robustness, stability, efficiency, and cost.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 58 of its 77 references that are in the map. First posted on arXiv 25 Feb 2025.
Builds on
58 of 77 references.
References · 58
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understandingcited by 4,854
- 2016Wide Residual Networkscited by 3,057
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,201
- 2017Improved Regularization of Convolutional Neural Networks with Cutoutcited by 1,623
- 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
- 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
- 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 776
38 more
- 2017Exploring Generalization in Deep Learningcited by 595
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 547
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 357
- 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 291
- 2014Identifying and attacking the saddle point problem in high-dimensional non-convex optimizationcited by 286
- 2023Sophia: A Scalable Stochastic Second-order Optimizer for Language Model Pre-trainingcited by 260
- 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
- 2019Limitations of the Empirical Fisher Approximation for Natural Gradient Descentcited by 213
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 201
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 171
- 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
- 2017Practical Gauss-Newton Optimisation for Deep Learningcited by 139
- 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
- 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
- 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 125
- 2024Why Transformers Need Adam: A Hessian Perspectivecited by 123
- 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
- 2022Better plain ViT baselines for ImageNet-1kcited by 97
- 2023Convergence of Adam Under Relaxed Assumptionscited by 97
- 2022Sharpness-Aware Training for Freecited by 95
- 2017Shake-Shake regularizationcited by 87
- 2018On the Relation Between the Sharpest Directions of DNN Loss and the SGD Step Lengthcited by 85
- 2022Make Sharpness-Aware Minimization Stronger: A Sparsified Perturbation Approachcited by 70
- 2014A Stochastic Quasi-Newton Method for Large-Scale Optimizationcited by 68
- 2020Practical Quasi-Newton Methods for Training Deep Neural Networkscited by 67
- 2020SqueezeBERT: What can computer vision teach NLP about efficient neural networks?cited by 50
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 48
- 2015Equilibrated adaptive learning rates for non-convex optimizationcited by 42
- 2022Anticorrelated Noise Injection for Improved Generalizationcited by 41
- 2017Second-Order Optimization for Non-Convex Machine Learning: An Empirical Studycited by 35
- 2020When Does Preconditioning Help or Hurt Generalization?cited by 30
- 2016Stochastic Block BFGS: Squeezing More Curvature out of Datacited by 24
- 2023SAM operates far from home: eigenvalue regularization as a dynamical phenomenoncited by 24
50 most cited of 58 All 58 (JSON)
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.