AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Escape saddle points by a simple gradient-descent based algorithm

NeurIPS 2021 · Optimization › Nonconvex and smooth optimization · approach: Saddle-point escape algorithms · 2 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
replace uniform perturbation in PGD with negative curvature finding (NC-finding)perturbed gradient descent · quartic test function with saddle at originiterations to escape saddle: less than $1/3$ timesHelped
replace perturbation in PSGD with SNC-findingperturbed stochastic gradient descent · cubic test functioniterations to escape saddle: $1/2$ timesHelped
replace PAGD with ANCGDperturbed accelerated gradient descent · nonconvex test functionsiterations to escape saddle: less than $1/3$ timesHelped
replace NEON+ with ANCGDNEON+ · nonconvex test functionsiterations to escape saddle: $1/2$ timesHelped
use gradient-based negative curvature finding with single loop instead of nested-loop or higher log-power single-loop methodsnon-stochastic saddle escaping · theoryiteration complexity: $\tilde{O}(\log^{6} n/\epsilon^{1.75})$ -> $\tilde{O}(\log n/\epsilon^{1.75})$Helped

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