atlas

Research map / Optimization / Nonconvex and smooth optimization

Natasha: Faster Non-Convex Stochastic Optimization via Strongly Non-Convex Parameter

ICML 2017 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 34 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 Natasha1, with regularization-based retraction and sub-epochs, instead of prior offline methodsσ-bounded nonconvex optimization · Functions with σ ≥ L / √ngradient complexityHelped
Use Natasha1 rather than repeatSVRG in the regime σ < L / √nσ-bounded nonconvex optimization · Functions with σ < L / √ngradient complexityMixed
Use Natasha1 rather than repeatSVRGσ-bounded nonconvex optimization · σ = Lgradient complexityNo clear effect
Use Natasha2 with the added Katyusha-style averaging updateOptimization with (ℓ1,ℓ2)-smooth component functions · n ≥ ℓ1ℓ2 / σ² or n ≤ [paper's stated alternative condition]gradient complexityMixed

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