AdamX: Cosine similarity meets gradient descent
Not on the map. Why?
Abstract (arXiv)
We introduce AdamX, a first-order optimizer that incorporates cosine similarity as an adaptive mechanism for controlling update magnitudes. The proposed method is scalable, model-agnostic, and straightforward to integrate into existing training pipelines. We further introduce a variance rectification scheme that promotes smoother optimization during the early stages of training. Overall, we provide empirical evidence that AdamX achieves competitive convergence rates across a range of benchmark datasets and architectures. Performance is evaluated in terms of the number of epochs required to reach predefined performance thresholds under a fixed hyperparameter budget. Code and Experiments available at: https://github.com/FranciscoCaldas/adamX.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 13 of its 24 references that are in the map. First posted on arXiv 10 Sep 2026.
Builds on
13 of 24 references.
References · 13
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2019On the Convergence of Adam and Beyondcited by 841
- 2019On the Variance of the Adaptive Learning Rate and Beyondcited by 772
- 2023Symbolic Discovery of Optimization Algorithmscited by 434
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 426
- 2020AdaBelief Optimizer: Adapting Stepsizes by the Belief in Observed Gradientscited by 283
- 2022Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Modelscited by 174
- 2020A Simple Convergence Proof of Adam and Adagradcited by 171
- 2020Descending through a Crowded Valley - Benchmarking Deep Learning Optimizerscited by 119
- 2017Online Learning Rate Adaptation with Hypergradient Descentcited by 118
- 2023Benchmarking Neural Network Training Algorithmscited by 52
- 2019DeepOBS: A Deep Learning Optimizer Benchmark Suitecited by 37
1 more
Built on by
Not cited yet.