A Method for Enhancing Generalization of Adam by Multiple Integrations
Not on the map. Why?
Abstract (arXiv)
The insufficient generalization of adaptive moment estimation (Adam) has hindered its broader application. Recent studies have shown that flat minima in loss landscapes are highly associated with improved generalization. Inspired by the filtering effect of integration operations on high-frequency signals, we propose multiple integral Adam (MIAdam), a novel optimizer that integrates a multiple integral term into Adam. This multiple integral term effectively filters out sharp minima encountered during optimization, guiding the optimizer towards flatter regions and thereby enhancing generalization capability. We provide a theoretical explanation for the improvement in generalization through the diffusion theory framework and analyze the impact of the multiple integral term on the optimizer's convergence. Experimental results demonstrate that MIAdam not only enhances generalization and robustness against label noise but also maintains the rapid convergence characteristic of Adam, outperforming Adam and its variants in state-of-the-art benchmarks.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 20 of its 34 references that are in the map. First posted on arXiv 17 Dec 2024.
Builds on
20 of 34 references.
References · 20
- 2015Deep Residual Learning for Image Recognitioncited by 52,096
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2016Densely Connected Convolutional Networkscited by 6,720
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,352
- 2019Fantastic Generalization Measures and Where to Find Themcited by 513
- 2017Sharp Minima Can Generalize For Deep Netscited by 466
- 2019PyHessian: Neural Networks Through the Lens of the Hessiancited by 292
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2020ADAHESSIAN: An Adaptive Second Order Optimizer for Machine Learningcited by 202
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
- 2016Deep Pyramidal Residual Networkscited by 163
- 2017Improving Generalization Performance by Switching from Adam to SGDcited by 125
8 more
- 2020Relative Flatness and Generalizationcited by 88
- 2021BertGCN: Transductive Text Classification by Combining GCN and BERTcited by 74
- 2021Understanding the Generalization of Adam in Learning Neural Networks with Proper Regularizationcited by 49
- 2023Dynamic Regularized Sharpness Aware Minimization in Federated Learning: Approaching Global Consistency and Smooth Landscapecited by 46
- 2020Adaptive Inertia: Disentangling the Effects of Adaptive Learning Rate and Momentumcited by 40
- 2020AdaScale SGD: A User-Friendly Algorithm for Distributed Trainingcited by 16
- 2018Identifying Generalization Properties in Neural Networkscited by 15
- 2020Stochastic Gradient Variance Reduction by Solving a Filtering Problemcited by 4
Built on by
Citing papers per year: 2026: 2.
2 papers.