atlas

Research map / Optimization / Nonconvex and smooth optimization

Unifying Nesterov's Accelerated Gradient Methods for Convex and Strongly Convex Objective Functions

ICML 2023 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics

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
Unified AGM (adaptive momentum unifying AGM-C and AGM-SC) instead of AGM-C or AGM-SC aloneUnified AGM · ℓ2-regularized logistic regression, µ from 10^-1 to 10^-5f(x_k)-f(x*)No clear effect
Unified ATM (higher-order unified method) instead of ATM-C or ATM-SC aloneUnified ATM · Cubic-regularized linear regression, µ from 3·10^-3 to 3·10^-9f(x_k)-f(x*)No clear effect
AGM-SC instead of AGM-C when µ is large vs smallAGM-SC · ℓ2-regularized logistic regressionf(x_k)-f(x*)Mixed
Adding the unified time-varying momentum (unified AGM ODE/algorithm) with an ill-conditioned strongly convex objectiveUnified AGM vs AGM-C · Theory: convergence rate boundconvergence rate boundHelped
Unified AGM-G ODE for minimizing gradient norm of strongly convex functions vs OGM-G ODEGradient-norm ODE · Theory: gradient norm convergenceconvergence rate boundHelped

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