atlas

Research map / Optimization / Nonconvex and smooth optimization

Third-order Smoothness Helps: Faster Stochastic Optimization Algorithms for Finding Local Minima

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Nonconvex minimax and constrained methods · 7 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 third-order smoothness to take a larger negative-curvature stepFLASH-Stochastic · General stochastic nonconvex optimizationstochastic gradient evaluations: eO(✏−7/2) -> eO(✏−10/3)Helped
Use FLASH's larger negative-curvature stepMatrix sensing · Matrix sensing, d = 50 and d = 100objective function value versus oracle callsHelped
Use FLASH's larger negative-curvature stepDeep autoencoder · MNIST autoencoders AE-1 and AE-2training and test loss versus oracle callsHelped
Decrease the negative-curvature step size (ablation)FLASH · Matrix sensing, d = 50 and d = 100objective function value versus oracle callsHurt
Use unperturbed first-order methods without negative-curvature escapeSGD, SGD-m, and SCSG · Matrix sensingability to escape saddle pointsHurt

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