AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Gradient Descent Can Take Exponential Time to Escape Saddle Points

NeurIPS 2017 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 63 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
Add episodic random perturbations to gradient descentGradient descent · Constructed smooth function with uniform initialization on [-1, 1]^diterations to reach a local minimum: e^{\Omega(d)} versus polynomial timeHelped
Add episodic random perturbations to gradient descentGradient descent · Constructed counter-exampleiterations to escape successive saddle points: \left(\frac{L+\gamma}{\gamma}\right)^d versus polynomial timeHelped
Increase the ratio \frac{L+\gamma}{\gamma}Gradient descent on the constructed counter-example · Constructed counter-example, d=5 and d=10iterations to escape a saddle point: \frac{L+\gamma}{\gamma}Hurt
Increase the ratio \frac{L+\gamma}{\gamma}Perturbed gradient descent on the constructed counter-example · Constructed counter-example, d=5 and d=10iterations to escape a saddle pointNo 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