atlas

Research map / Optimization / Nonconvex and smooth optimization

On the Local Minima of the Empirical Risk

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 26 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
Apply Gaussian smoothing and perturbed stochastic gradient descent to the observed functionPointwise-close approximation f of a smooth nonconvex objective F · Nonconvex objective with polynomially many function queriesfunction-error tolerance: O(ε^2/d^8) -> O(√(ε^3/ρ)·(1/d))Helped
Allow exponentially many function queriesFinding an ε-SOSP of F from values of f · Nonconvex objective with unlimited queriesfunction-error tolerance: ν ≤ O(√(ε^3/ρ)·(1/d)) -> ν ≤ O(√(ε^3/ρ))Helped
Use a sample size n ≥ Õ(d^4/ε^3)ZPSGD for learning a ReLU unit · ReLU unit learningestimation error: ‖ŵ - w*‖ ≤ ε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