AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Algorithms and matching lower bounds for approximately-convex optimization

Andrej Risteski, Yuanzhi Li

NeurIPS 2016 · Optimization › Nonconvex and smooth optimization · approach: Coordinate and Adam convergence analysis · 9 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
Information-theoretic lower bound construction: hide a random linear function inside a non-linear, non-smooth function with approximation error Delta = max(eps^2/sqrt(d), eps/d) (up to polylog)approximately-convex zero-order optimization over convex bodies · unit-diameter convex body in R^d, 1-Lipschitz convex fqueries needed to find eps-optimal pointImproved
Algorithm using a robust zeroth-order gradient estimator (Stokes-formula smoothing) with extension of the function outside K via distance penaltyapproximately-convex optimization over well-conditioned convex bodies · Delta <= max(eps^2/(mu sqrt(d)), eps/d) with mu-well-conditioned bodypolynomial runtime in d and 1/epsImproved
Prior local-search method of DKS14 limited to Delta = O(eps/sqrt(d)) for smooth functions; new method extends to Delta up to eps^2/sqrt(d)approximately-convex optimization · theoretical comparison with prior workmaximum tolerable approximation error DeltaImproved

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