Anon: Extrapolating Adaptivity Beyond SGD and Adam

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Zhang, Yiheng, Zhao, Kaiyan, Wu, Shaowu, Wang, Yiming, Wu, Jiajun, U, Leong Hou, Drew, Steve, Niu, Xiaoguang
Natura: Preprint
Pubblicazione: 2026
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866917463050944512
author Zhang, Yiheng
Zhao, Kaiyan
Wu, Shaowu
Wang, Yiming
Wu, Jiajun
U, Leong Hou
Drew, Steve
Niu, Xiaoguang
author_facet Zhang, Yiheng
Zhao, Kaiyan
Wu, Shaowu
Wang, Yiming
Wu, Jiajun
U, Leong Hou
Drew, Steve
Niu, Xiaoguang
contents Adaptive optimizers such as Adam have achieved great success in training large-scale models like large language models and diffusion models. However, they often generalize worse than non-adaptive methods, such as SGD on classical architectures like CNNs. We identify a key cause of this performance gap: adaptivity in pre-conditioners, which limits the optimizer's ability to adapt to diverse optimization landscapes. To address this, we propose Anon (Adaptivity Non-restricted Optimizer with Novel convergence technique), a novel optimizer with continuously tunable adaptivity in R, allowing it to interpolate between SGD-like and Adam-like behaviors and even extrapolate beyond both. To ensure convergence across the entire adaptivity spectrum, we introduce incremental delay update (IDU), a novel mechanism that is more flexible than AMSGrad's hard max-tracking strategy and enhances robustness to gradient noise. We theoretically establish convergence guarantees under both convex and non-convex settings. Empirically, Anon consistently outperforms state-of-the-art optimizers on representative image classification, diffusion, and language modeling tasks. These results demonstrate that adaptivity can serve as a valuable tunable design principle, and Anon provides the first unified and reliable framework capable of bridging the gap between classical and modern optimizers and surpassing their advantageous properties.
format Preprint
id arxiv_https___arxiv_org_abs_2605_02317
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Anon: Extrapolating Adaptivity Beyond SGD and Adam
Zhang, Yiheng
Zhao, Kaiyan
Wu, Shaowu
Wang, Yiming
Wu, Jiajun
U, Leong Hou
Drew, Steve
Niu, Xiaoguang
Artificial Intelligence
Machine Learning
Adaptive optimizers such as Adam have achieved great success in training large-scale models like large language models and diffusion models. However, they often generalize worse than non-adaptive methods, such as SGD on classical architectures like CNNs. We identify a key cause of this performance gap: adaptivity in pre-conditioners, which limits the optimizer's ability to adapt to diverse optimization landscapes. To address this, we propose Anon (Adaptivity Non-restricted Optimizer with Novel convergence technique), a novel optimizer with continuously tunable adaptivity in R, allowing it to interpolate between SGD-like and Adam-like behaviors and even extrapolate beyond both. To ensure convergence across the entire adaptivity spectrum, we introduce incremental delay update (IDU), a novel mechanism that is more flexible than AMSGrad's hard max-tracking strategy and enhances robustness to gradient noise. We theoretically establish convergence guarantees under both convex and non-convex settings. Empirically, Anon consistently outperforms state-of-the-art optimizers on representative image classification, diffusion, and language modeling tasks. These results demonstrate that adaptivity can serve as a valuable tunable design principle, and Anon provides the first unified and reliable framework capable of bridging the gap between classical and modern optimizers and surpassing their advantageous properties.
title Anon: Extrapolating Adaptivity Beyond SGD and Adam
topic Artificial Intelligence
Machine Learning
url https://arxiv.org/abs/2605.02317