Pith. sign in

Near-optimal Closed-loop Method via Lyapunov Damping for Convex Optimization

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
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

background 1

citation-polarity summary

fields

cs.LG 1

years

2025 1

verdicts

CONDITIONAL 1

roles

background 1

polarities

background 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Stochastic Adaptive Gradient Descent Without Descent cs.LG · 2025-09-18 · conditional · none · ref 34 · internal anchor

    A new adaptive step-size for SGD, built on the AdaGD Lyapunov function, provably converges in several convex settings without tuned hyper-parameters.