atlas

Research map / Optimization / Nonconvex and smooth optimization

On the Curved Geometry of Accelerated Optimization

NeurIPS 2019 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use the dual Bregman geometry of f* to construct the accelerated gradient dynamics from the proximal point methodProposed AGM ODE · Strongly convex, L-smooth quadratic objectivescontinuous-time decay rate: \rho_{\text{AGM}}\geq\frac{1}{2}\sqrt{\frac{\mu}{L}}Helped
Set the inertia parameter α anywhere in [0,1] (ablation)AGM ODE · Strongly convex, L-smooth quadratic objectivescontinuous-time decay rate: ρ=\frac{1}{2}\sqrt{\frac{\mu}{L}}No clear effect
Remove the extra inertia by setting α=0 (ablation)Proximal-point-derived method · General convex problemsaccelerated convergence rateHurt

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy