atlas

Research map / Optimization / Nonconvex and smooth optimization

On the Convergence of Nesterov’s Accelerated Gradient Method in Stochastic Settings

ICML 2020 · Optimization › Nonconvex and smooth optimization · approach: Stochastic variance reduction · 10 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 Nesterov ASG with the standard accelerated parametersSmooth strongly-convex quadratic objectives with unbiased, independent bounded-variance gradients · Stochastic approximationconvergence rate: ((√Q - 1)/√Q + ε_k)^(2k) versus ((Q - 1)/(Q + 1))^(2k)Helped
Use standard Nesterov step-size and momentum instead of parameters ensuring R(α, β) < 1Finite-sum ASG on smooth strongly-convex quadratic component functions · Finite-sumexpected distance to optimum: lim_{k → ∞} E[‖y_k - x*‖] = ∞Hurt
Use parameters satisfying R(α, β) < 1ASG on smooth strongly-convex finite sums · Finite-sumconvergence: R(α, β)^kHelped
Set momentum β to 0 (ablation)ASG on smooth strongly-convex objectives · Stochastic approximationconvergence rate: ((Q - 1)/(Q + 1))^(2k) versus ((√Q - 1)/√Q + ε_k)^(2k)Hurt
Set momentum β to 0 and use α = 2/(μ + L) (ablation)ASG on smooth strongly-convex finite sums · Finite-sumconvergence rate: ((Q - 1)/(Q + 1))^kMixed

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