Overview

Adaptive gradient methods use information from current and past gradients to choose update sizes and directions, aiming to train more reliably than fixed-step gradient descent. Common approaches include momentum and learning-rate schedules, coordinate-wise methods such as Adam and AdaGrad, and block or matrix preconditioners such as Shampoo, often combined with orthogonalized updates. Researchers study their convergence and stability as well as their practical use in large language models, vision, scientific machine learning, and privacy-sensitive training. A central tension is that adaptivity can improve speed or robustness but costs memory and computation, and no optimizer consistently wins across tasks; guarantees and generalization depend on data, noise, geometry, and hyperparameter choices.

Latest papers

CardsList

157 papers14 papers in the last four weeks, down 7% on the four weeks before. 0.1% of all new papers.

  1. A unified convergence theory for adaptive first-order methods in the nonconvex case, including AdaNorm, full and diagonal AdaGrad, Shampoo and Muo

    Apr 19, 2026S. Gratton, Ph. L. TointMomentum MethodsNonconvex Stochastic Optimization

  2. A short proof of near-linear convergence of adaptive gradient descent under fourth-order growth and convexity

    Apr 15, 2026Damek Davis, Dmitriy DrusvyatskiyGradient DescentAdaptive Gradient Methods

  3. Evolution of Optimization Methods: Algorithms, Scenarios, and Evaluations

    Apr 14, 2026Tong Zhang, Jiangning Zhang, Zhucun Xue +9Deep Learning OptimizationAdaptive Gradient Methods

  4. Muon2^2: Boosting Muon via Adaptive Second-Moment Preconditioning

    Apr 11, 2026Ziyue Liu, Ruijie Zhang, Zhengyang Wang +4Neural Network OptimizationMuon Optimizer

  5. Delve into the Applicability of Advanced Optimizers for Multi-Task Learning

    Apr 10, 2026Zhipeng Zhou, Linxiao Cao, Pengcheng Wu +2Orthogonal OptimizationMulti-Task Learning

  6. Deterministic Adam-Inspired Methods with Accelerated Convergence Rate

    Apr 9, 2026Yaxin Yu, Long Chen, Zeyi XuAccelerated Gradient MethodsAdaptive Gradient Methods

  7. FlowAdam: Implicit Regularization via Geometry-Aware Soft Momentum Injection

    Apr 8, 2026Devender Singh, Tarun SheelHypergradient OptimizationAdaptive Gradient Methods

  8. Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method

    Mar 19, 2026Steffen Dereich, Thang Do, Arnulf JentzenStochastic OptimizationStochastic Optimization Convergence

  9. Rethinking Adam for Time Series Forecasting: A Simple Heuristic to Improve Optimization under Distribution Shifts

    Mar 10, 2026Yuze Dong, Jinsong WuAdaptive Gradient MethodsNon-Stationary Time Series Forecasting

  10. Towards Understanding Adam Convergence on Highly Degenerate Polynomials

    Mar 10, 2026Zhiwei Bai, Jiajie Zhao, Zhangchen Zhou +2Optimization Convergence AnalysisAdaptive Gradient Methods

  11. Combining Adam and its Inverse Counterpart to Enhance Generalization of Deep Learning Optimizers

    Mar 7, 2026Tao Shi, Liangming Chen, Long Jin +1Neural Network OptimizationAdaptive Gradient Methods

  12. Adaptive Methods Are Preferable in High Privacy Settings: An SDE Perspective

    Mar 3, 2026Enea Monzio Compagnoni, Alessandro Stanghellini, Rustem Islamov +2Differentially Private Stochastic Gradient DescentDifferential Privacy

  13. Why Adam Can Beat SGD: Second-Moment Normalization Yields Sharper Tails

    Mar 3, 2026Ruinan Jin, Yingbin Liang, Shaofeng ZouStochastic Optimization ConvergenceAdaptive Gradient Methods

  14. HomeAdam: Adam and AdamW Algorithms Sometimes Go Home to Obtain Better Provable Generalization

    Mar 3, 2026Feihu Huang, Guanyi Zhang, Songcan ChenAdaptive Gradient MethodsNeural Network Generalization

  15. Adam Converges Without Any Modification On Update Rules

    Mar 2, 2026Yushun Zhang, Bingran Li, Congliang Chen +2Optimization Convergence AnalysisAdaptive Gradient Methods

  16. Never Saddle for Reparameterized Steepest Descent as Mirror Flow

    Mar 2, 2026Tom Jacobs, Chao Zhou, Rebekka BurkholzNeural Network Training DynamicsGradient Descent Dynamics

  17. Extending μμP: Spectral Conditions for Feature Learning Across Optimizers

    Feb 24, 2026Akshita Gupta, Marieme Ngom, Sam Foreman +1Hyperparameter TransferAdaptive Gradient Methods

  18. Adam Improves Muon: Adaptive Moment Estimation with Orthogonalized Momentum

    Feb 19, 2026Minxin Zhang, Yuxuan Liu, Hayden SchaefferDeep Learning OptimizationAdaptive Gradient Methods

  19. Optimizer choice matters for the emergence of Neural Collapse

    Feb 18, 2026Jim Zhao, Tin Sum Cheng, Wojciech Masarczyk +1Neural CollapseNeural Network Training Dynamics

  20. The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networks

    Feb 18, 2026Eitan Gronich, Gal VardiGradient DescentAdaptive Gradient Methods

  21. POP: Prior-Fitted First-Order Optimization Policies

    Feb 17, 2026Jan Kobiolka, Christian Frey, Gresa Shala +3Learning to OptimizeAdaptive Gradient Methods

  22. Why GRPO Needs Normalization: A Local-Curvature Perspective on Adaptive Gradients

    Jan 30, 2026Cheng Ge, Caitlyn Heqi Yin, Hao Liang +1RL for Language Model ReasoningGroup Relative Policy Optimization

  23. Why β1=β2β_1 = β_2 Is Dynamically Special in Adam

    Jan 29, 2026Alberto Fernández-Hernández, Cristian Pérez-Corral, Jose I. Mestre +2Momentum MethodsAdaptive Gradient Methods

  24. Adam symmetry theorem: characterization of the convergence of the stochastic Adam optimizer

    Nov 10, 2025Steffen Dereich, Thang Do, Arnulf Jentzen +1Stochastic OptimizationStochastic Optimization Convergence