atlas

Research map / Optimization / Nonconvex and smooth optimization

Efficiently testing local optimality and escaping saddles for ReLU networks

ICLR 2019 · Optimization › Nonconvex and smooth optimization · approach: Saddle-point escape algorithms · 4 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 shared extreme-ray tests instead of enumerating all activation regionsSOSP-Check · Two-layer ReLU-like empirical riskfirst-order test complexity: O(2^M) to O(M)Helped
Use projected gradient descent for the equality-constrained second-order QPSOSP-Check · Benign case with no flat extreme raysQP solution time per update: O(p^2)Helped
Handle flat extreme rays with inequality-constrained QPsSOSP-Check · Cases with L flat extreme raysQP solving time complexity: O(p^3 + L^3 2^L)Mixed
Train on larger model/data settings in the reported artificial-data experimentsAdam-trained ReLU networks · Artificial standard-normal dataaverage flat extreme rays (L): 0 (0) to 37 (0.925)Mixed
Apply the SOSP-Check approach to trained networks with boundary data pointsSOSP-Check · Artificial standard-normal data; 280 runsflat extreme rays: usually zero or very few (maximum was 3)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