PulseAugur
EN
LIVE 09:59:22

New Adam-inspired methods show accelerated convergence for convex objectives

Researchers have developed new deterministic methods inspired by the Adam optimizer, aiming to improve convergence rates for smooth convex objectives. These methods, Adam-HNAG and Adam-HNAG-s, utilize a variable-and-operator splitting technique to decouple momentum and adaptive preconditioning. By incorporating a Hessian-driven correction and Adam-style gradient feedback, the new algorithms demonstrate a discrete Lyapunov contraction, leading to an O(k^-2) objective-value bound under specific conditions. Numerical experiments suggest these methods offer improved performance compared to the original Adam recursion. AI

IMPACT Introduces novel optimization techniques that could enhance the training efficiency of machine learning models.

RANK_REASON Academic paper detailing new optimization algorithms. [lever_c_demoted from research: ic=1 ai=1.0]

Read on arXiv cs.LG →

AI-generated summary · Google Gemini · from 1 sources. How we write summaries →

New Adam-inspired methods show accelerated convergence for convex objectives

COVERAGE [1]

  1. arXiv cs.LG TIER_1 English(EN) · Yaxin Yu, Long Chen, Zeyi Xu ·

    Deterministic Adam-Inspired Methods with Accelerated Convergence Rate

    arXiv:2604.08742v2 Announce Type: replace-cross Abstract: Adam is widely used, but its convergence theory remains incomplete even in the deterministic full-batch setting because momentum and adaptive preconditioning are tightly coupled. For smooth convex objectives, we split the …