The paper introduces (L,\bar L)-anisotropic smoothness and proves O(1/K) convergence rates for nonlinearly preconditioned gradient methods, unifying gradient clipping, Adam, and Adagrad under one theory.
Improved anal- ysis of clipping algorithms for non-convex optimization
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Nonlinearly Preconditioned Gradient Methods under Generalized Smoothness
The paper introduces (L,\bar L)-anisotropic smoothness and proves O(1/K) convergence rates for nonlinearly preconditioned gradient methods, unifying gradient clipping, Adam, and Adagrad under one theory.