A new adaptive step-size for SGD, built on the AdaGD Lyapunov function, provably converges in several convex settings without tuned hyper-parameters.
Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
We introduce an autonomous system with closed-loop damping for first-order convex optimization. While, to this day, optimal rates of convergence are almost exclusively achieved by non-autonomous methods via open-loop damping (e.g., Nesterov's algorithm), we show that our system, featuring a closed-loop damping, exhibits a rate arbitrarily close to the optimal one. We do so by coupling the damping and the speed of convergence of the system via a well-chosen Lyapunov function. By discretizing our system we then derive an algorithm and present numerical experiments supporting our theoretical findings.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Stochastic Adaptive Gradient Descent Without Descent
A new adaptive step-size for SGD, built on the AdaGD Lyapunov function, provably converges in several convex settings without tuned hyper-parameters.