Promoting Exploration in Memory-Augmented Adam using Critical Momenta
Not on the map. Why?
Abstract (arXiv)
Adaptive gradient-based optimizers, notably Adam, have left their mark in training large-scale deep learning models, offering fast convergence and robustness to hyperparameter settings. However, they often struggle with generalization, attributed to their tendency to converge to sharp minima in the loss landscape. To address this, we propose a new memory-augmented version of Adam that encourages exploration towards flatter minima by incorporating a buffer of critical momentum terms during training. This buffer prompts the optimizer to overshoot beyond narrow minima, promoting exploration. Through comprehensive analysis in simple settings, we illustrate the efficacy of our approach in increasing exploration and bias towards flatter minima. We empirically demonstrate that it can improve model performance for image classification on ImageNet and CIFAR10/100, language modelling on Penn Treebank, and online learning tasks on TinyImageNet and 5-dataset. Our code is available at urlhttps://github.com/chandar-lab/CMOptimizer.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 38 of its 65 references that are in the map. First posted on arXiv 18 Jul 2023.
Builds on
38 of 65 references.
References · 38
- 2017Attention Is All You Needcited by 60,361
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2019EfficientNet: Rethinking Model Scaling for Convolutional Neural Networkscited by 6,442
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
- 2016Wide Residual Networkscited by 3,070
- 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
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,209
- 2017Exploring Generalization in Deep Learningcited by 600
26 more
- 2017Computing Nonvacuous Generalization Bounds for Deep (Stochastic) Neural Networks with Many More Parameters than Training Datacited by 533
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 402
- 2016Entropy-SGD: Biasing Gradient Descent Into Wide Valleyscited by 359
- 2019Lookahead Optimizer: k steps forward, 1 step backcited by 336
- 2021ASAM: Adaptive Sharpness-Aware Minimization for Scale-Invariant Learning of Deep Neural Networkscited by 293
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 283
- 2021When Vision Transformers Outperform ResNets without Pre-training or Strong Data Augmentationscited by 260
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2022Surrogate Gap Minimization Improves Sharpness-Aware Trainingcited by 172
- 2021Efficient Sharpness-aware Minimization for Improved Training of Neural Networkscited by 137
- 2021An Empirical Investigation of the Role of Pre-training in Lifelong Learningcited by 134
- 2022Towards Efficient and Scalable Sharpness-Aware Minimizationcited by 129
- 2020Towards Theoretically Understanding Why SGD Generalizes Better Than ADAM in Deep Learningcited by 126
- 2014Analysis and Design of Optimization Algorithms via Integral Quadratic Constraintscited by 105
- 2019On Empirical Comparisons of Optimizers for Deep Learningcited by 103
- 2022Adaptive Gradient Methods at the Edge of Stabilitycited by 101
- 2022Sharpness-Aware Training for Freecited by 95
- 2022Fisher SAM: Information Geometry and Sharpness Aware Minimisationcited by 84
- 2022On the Maximum Hessian Eigenvalue and Generalizationcited by 57
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 49
- 2021Reproducibility Report: La-MAML: Look-ahead Meta Learning for Continual Learningcited by 42
- 2021Adaptivity without Compromise: A Momentumized, Adaptive, Dual Averaged Gradient Method for Stochastic Optimizationcited by 28
- 2021Memory Augmented Optimizers for Deep Learningcited by 5
- 2020Iterative Averaging in the Quest for Best Test Errorcited by 1
- 2022When is Momentum Extragradient Optimal? A Polynomial-Based Analysiscited by 1
Built on by
Not cited yet.