EXAdam: The Power of Adaptive Cross-Moments
Not on the map. Why?
Abstract (arXiv)
This paper introduces EXAdam (EXtended Adam), a novel optimization algorithm that builds upon the widely-used Adam optimizer. EXAdam incorporates two key enhancements: (1) new debiasing terms for improved moment estimation and (2) a gradient-based acceleration mechanism for increased responsiveness to the current loss landscape. These innovations work synergistically to address limitations of the original Adam algorithm, potentially offering improved convergence properties, enhanced ability to escape saddle points, and potentially greater robustness to hyperparameter choices, though this requires further investigation. We provide a theoretical analysis of EXAdam's components and their interactions, highlighting the algorithm's potential advantages in navigating complex optimization landscapes. Empirical evaluations demonstrate EXAdam's superiority over Adam, achieving 38.46% faster convergence and yielding improvements of 1.96%, 2.17%, and 1.17% in training, validation, and testing accuracies, respectively, when applied to a CNN trained on the CIFAR-10 dataset. While these results are promising, further empirical validation across diverse tasks is essential to fully gauge EXAdam's efficacy. Nevertheless, EXAdam represents a significant advancement in adaptive optimization techniques, with promising implications for a wide range of machine learning applications. This work aims to contribute to the ongoing development of more efficient, adaptive, and universally applicable optimization methods in the field of machine learning and artificial intelligence.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 8 of its 18 references that are in the map. First posted on arXiv 29 Dec 2024.
Builds on
8 of 18 references.
References · 8
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,344
- 2016An overview of gradient descent optimization algorithmscited by 1,028
- 2018Adafactor: Adaptive Learning Rates with Sublinear Memory Costcited by 900
- 2019On the Convergence of Adam and Beyondcited by 837
- 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 567
- 2017Sharp Minima Can Generalize For Deep Netscited by 465
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 250
- 2019Adaptive Gradient Methods with Dynamic Bound of Learning Ratecited by 183
Built on by
Citing papers per year: 2026: 1.
1 paper.