Research map / Optimization / Nonconvex and smooth optimization
Optimization of Smooth Functions with Noisy Observations: Local Minimax Rates
Yining Wang, Sivaraman Balakrishnan, Aarti Singh
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 changed | Where | Measured | Effect |
|---|---|---|---|
| Adaptively focus queries on shrinking estimated near-optimal level sets | Noisy smooth global optimization · Local neighborhoods of reference functions with level-set growth parameter beta | optimization error rate: n^{-\alpha/(2\alpha+d)} -> n^{-\alpha/(2\alpha+d-\alpha\beta)} | Improved |
| Use passive uniform queries instead of adaptive queries | Noisy smooth global optimization · Functions with additional level-set assumptions | optimization error rate: n^{-\alpha/(2\alpha+d-\alpha\beta)} -> [\log n/n]^{\alpha/(2\alpha+d)} | Hurt |
| Use a constant reference function, with beta=0 | Adaptive active algorithm · Noisy global optimization near f0=0 | local 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 optimization | Adaptive active algorithm · Functions smooth only on a neighborhood of their minimum | optimization error | Improved |
Closest papers by meaning
- Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods (ICLR 2025 · similarity 0.90)
- Stochastic Zeroth-Order Optimization under Strongly Convexity and Lipschitz Hessian: Minimax Sample Complexity (NeurIPS 2024 · similarity 0.90)
- Methods for Convex $(L_0,L_1)$-Smooth Optimization: Clipping, Acceleration, and Adaptivity (ICLR 2025 · similarity 0.89)
- Efficiently Escaping Saddle Points under Generalized Smoothness via Self-Bounding Regularity (NeurIPS 2025 · similarity 0.88)
- Stochastic Zeroth-Order Optimization Under Heavy-Tailed Noise (NeurIPS 2026 · similarity 0.88)
- Decentralized Gradient-Free Methods for Stochastic Non-smooth Non-convex Optimization (AAAI 2024 · similarity 0.88)
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.
