AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Natasha 2: Faster Non-Convex Optimization Than SGD

Zeyuan Allen-Zhu

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 89 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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
Combine Natasha1.5 for stationary-point steps with Oja's algorithm for negative-curvature detectionNatasha2 · Approximate local minimagradient complexity: eO(ε−4) -> eO(ε−3.25)Improved
Use a negative-curvature direction from Oja's algorithm rather than random perturbation to escape saddle pointsNatasha2 · Approximate local minimagradient complexity: eO(ε−4 · poly(d)) -> eO(ε−3.25)Improved

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