AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Oracle Complexity in Nonsmooth Nonconvex Optimization

Guy Kornowski, Ohad Shamir

NeurIPS 2021 · Optimization › Nonconvex and smooth optimization · approach: Complexity of nonconvex first-order methods · 5 citations (OpenAlex)

Read the paperCheck your idea against 137,217 papers

AI-extracted. The measured effects below were read by AI from the paper's full text (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 any local-oracle algorithm to seek points near approximately stationary pointsLipschitz bounded-below nonconvex functions · Lipschitz bounded-below nonconvex functionsiterations required for worst-case guarantees: exponential dependence on $d$Hurt
Apply randomized smoothing1-Lipschitz nonsmooth nonconvex functions · 1-Lipschitz nonsmooth nonconvex functionsgradient Lipschitz parameter: $\frac{c \sqrt{d}}{\epsilon}$Mixed
Use Lasry-Lions regularization instead of computationally efficient smoothing1-Lipschitz nonsmooth nonconvex functions · 1-Lipschitz nonsmooth nonconvex functionsgradient Lipschitz parameter: $\frac{c}{\epsilon}$Improved

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