AI Paper Atlas

Research map / Optimization / Nonconvex and smooth optimization

Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates

Yining Wang, Sivaraman Balakrishnan, Aarti Singh

NeurIPS 2018 · Optimization › Nonconvex and smooth optimization · approach: Adaptive first-order convex methods · 10 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
Adaptively focus queries on shrinking estimated near-optimal level setsNoisy smooth global optimization · Local neighborhoods of reference functions with level-set growth parameter betaoptimization error rate: n^{-\alpha/(2\alpha+d)} -> n^{-\alpha/(2\alpha+d-\alpha\beta)}Improved
Use passive uniform queries instead of adaptive queriesNoisy smooth global optimization · Functions with additional level-set assumptionsoptimization error rate: n^{-\alpha/(2\alpha+d-\alpha\beta)} -> [\log n/n]^{\alpha/(2\alpha+d)}Hurt
Use a constant reference function, with beta=0Adaptive active algorithm · Noisy global optimization near f0=0local optimization error rate: R_n(f_0) \asymp n^{-\alpha/(2\alpha+d)}No clear effect
Allow only local smoothness near low function values, using pre-screening before optimizationAdaptive active algorithm · Functions smooth only on a neighborhood of their minimumoptimization errorImproved

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