arXiv (All)
open access
Sharp Minimax Rates for Highly Smooth Strongly Convex Zeroth-Order Optimization
We determine the minimax dimension dependence of noisy zeroth-order optimization for globally strongly convex functions with higher-order smoothness in multilinear operator norm. Each query returns one function value with fresh independent Gaussian noise. For dimension $d$, query budget $T$, and any
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Effective curvature dimension in smooth DC optimization#1064922
- Hessian Schatten-Norm Regularization for Linear Inverse Problems#235364
- Stronger Lower Bounds for (Non-)Anytime Acceleration of Gradient Descent#927502
- Decentralized Nonconvex Optimization under Heavy-Tailed Noise: Normalization and Optimal Convergence#147084
- Min-Max Optimisation for Nonconvex-Nonconcave Functions Using a Random Zeroth-Order Extragradient Algorithm#999651
Record · ID 1154899
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive