atlas

Research map / Optimization / Nonconvex and smooth optimization

Algorithmic Instabilities of Accelerated Gradient Descent

NeurIPS 2021 · 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
Apply NAG to general convex smooth objectives instead of restricting to quadraticsNAG · Convex smooth objectivesinitialization stability: O(T\epsilon) -> \exp(\Theta(T))\epsilonHurt
Apply full-batch NAG to general convex smooth empirical risks instead of restricting to quadraticsFull-batch NAG · Convex smooth empirical riskuniform stability: \Theta\brk{\ifrac{T^2}{n}} -> \ifrac{\exp(\Theta(T))}{n}Hurt
Use NAG rather than GD in the general convex smooth settingConvex smooth optimization · Convex smooth objectivesinitialization stability: \Theta(\epsilon) -> \exp(\Theta(T))\epsilonHurt
Use full-batch NAG rather than GD in the general convex smooth settingFull-batch optimization · Convex smooth empirical riskuniform stability: \Theta\brk{\ifrac{T}{n}} -> \ifrac{\exp(\Theta(T))}{n}Hurt

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