Skip to content
aiqbench takeMachine Learning

aiqbench analysis

AdamX presents a novel first-order optimizer that leverages cosine similarity to adaptively regulate update magnitudes, offering a scalable alternative to standard methods like Adam. By incorporating a variance rectification scheme, the method aims to smooth optimization trajectories during early training phases while maintaining competitive convergence rates across diverse architectures. This research advances the theoretical and practical landscape of machine learning optimization algorithms.
Source coveringarXiv
What this isA model's reading of the article and related coverage, written for aiqbench. Not the publisher's words.

AdamX: Cosine similarity meets gradient descent

arXiv1 min read

arXiv:2609.11867v1 Announce Type: new Abstract: 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.

Abstract: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: this https URL.

Machine Learning (cs.LG); Optimization and Control (math.OC)

arXiv:2609.11867 [cs.LG]

(or arXiv:2609.11867v1 [cs.LG] for this version)

https://doi.org/10.48550/arXiv.2609.11867 Focus to learn more arXiv-issued DOI via DataCite (pending registration)

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Full text under the publisher's open licence · 195 words

Related coverage