AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Private (Stochastic) Non-Convex Optimization Revisited: Second-Order Stationary Points and Excess Risks

Daogao Liu, Arun Ganesh, Sewoong Oh, Abhradeep Guha Thakurta

NeurIPS 2023 · Optimization › Nonconvex and smooth optimization · approach: Stochastic convex optimization complexity · 1 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 variance-reduced SpiderBoost-based private algorithm instead of prior private SOSP methodsPrivate SpiderBoost framework · Empirical alpha-SOSP (theory)alpha-SOSP rateImproved
Extend private SOSP guarantee from empirical to population riskPrivate SpiderBoost framework · Population alpha-SOSP (theory)alpha-SOSP rateImproved
Use exponential mechanism in polynomial time instead of prior methodExponential mechanism · Excess population risk, poly-timeexcess risk boundImproved
Allow exponential time for the exponential mechanismExponential mechanism · Excess population risk, exp-timeexcess risk boundImproved

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