Agnostic Sharpness-Aware Minimization
Not on the map. Why?
Abstract (arXiv)
Sharpness-aware minimization (SAM) has been instrumental in improving deep neural network training by minimizing both the training loss and the sharpness of the loss landscape, leading the model into flatter minima that are associated with better generalization properties. In another aspect, Model-Agnostic Meta-Learning (MAML) is a framework designed to improve the adaptability of models. MAML optimizes a set of meta-models that are specifically tailored for quick adaptation to multiple tasks with minimal fine-tuning steps and can generalize well with limited data. In this work, we explore the connection between SAM and MAML in enhancing model generalization. We introduce Agnostic-SAM, a novel approach that combines the principles of both SAM and MAML. Agnostic-SAM adapts the core idea of SAM by optimizing the model toward wider local minima using training data, while concurrently maintaining low loss values on validation data. By doing so, it seeks flatter minima that are not only robust to small perturbations but also less vulnerable to data distributional shift problems. Our experimental results demonstrate that Agnostic-SAM significantly improves generalization over baselines across a range of datasets and under challenging conditions such as noisy labels or data limitation.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 29 of its 42 references that are in the map. First posted on arXiv 11 Jun 2024.
Builds on
29 of 42 references.
References · 29
- 2017A Unified Approach to Interpreting Model Predictionscited by 6,488
- 2016"Why Should I Trust You?": Explaining the Predictions of Any Classifiercited by 5,040
- 2017Model-Agnostic Meta-Learning for Fast Adaptation of Deep Networkscited by 4,861
- 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
- 2017Exploring Generalization in Deep Learningcited by 595
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 527
- 2019Meta-Learning with Implicit Gradientscited by 523
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
- 2021SWAD: Domain Generalization by Seeking Flat Minimacited by 431
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
17 more
- 2017Three Factors Influencing Minima in SGDcited by 270
- 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 259
- 2018Probabilistic Model-Agnostic Meta-Learningcited by 254
- 2022Towards Understanding Sharpness-Aware Minimizationcited by 145
- 2022Generalized Federated Learning via Sharpness Aware Minimizationcited by 144
- 2015On the properties of variational approximations of Gibbs posteriorscited by 121
- 2021Sharpness-Aware Minimization Improves Language Model Generalizationcited by 108
- 2017Continuous Adaptation via Meta-Learning in Nonstationary and Competitive Environmentscited by 106
- 2022Sharpness-Aware Training for Freecited by 95
- 2020Relative Flatness and Generalizationcited by 88
- 2020The Implicit and Explicit Regularization Effects of Dropoutcited by 71
- 2022Sharp-MAML: Sharpness-Aware Model-Agnostic Meta Learningcited by 57
- 2024Friendly Sharpness-Aware Minimizationcited by 52
- 2019Emergent properties of the local geometry of neural loss landscapescited by 46
- 2022SAM as an Optimal Relaxation of Bayescited by 40
- 2022Stochastic Multiple Target Sampling Gradient Descentcited by 14
- 2021Memory-Based Optimization Methods for Model-Agnostic Meta-Learning and Personalized Federated Learningcited by 6
Built on by
Citing papers per year: 2024: 1; 2025: 1.
2 papers.