AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

NEON2: Finding Local Minima via First-Order Oracles

Zeyuan Allen-Zhu, Yuanzhi Li

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 64 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
Replace Neon with Neon2 in the SGD local-minimum methodSGD · Online local minimastochastic gradient complexity: eO(1/ε4 + 1/δ7) -> eO(1/ε4 + 1/(ε2δ3) + 1/δ5)Improved
Replace Neon with Neon2 when converting Natasha2Natasha2 · Online local minimastochastic gradient complexity: eO(1/ε3.25 + 1/(ε3δ) + 1/δ6) -> eO(1/ε3.25 + 1/(ε3δ) + 1/δ5)Improved
Use Neon2det instead of Hessian-vector products for NC-searchCDHS · Offline local minimafull gradient complexityNo clear effect
Use Neon2 to convert stationary-point methods into local-minimum methodsSGD, GD, SCSG, and SVRG · Local minimagradient complexityNo clear effect
Replace Hessian-vector products with gradient computations in NC-searchNeon2 · Online, deterministic, and finite-sum NC-searchgradient complexityNo clear effect

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