Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity
Site Bai, Brian Bullins
Abstract
In this paper, we provide tight lower bounds for the oracle complexity of minimizing high-order Hölder smooth and uniformly convex functions. Specifically, for a function whose -order derivatives are Hölder continuous with degree and parameter , and that is uniformly convex with degree and parameter , we focus on two asymmetric cases: (1) q > p + ν, and (2) q < p+ν. Given up to -order oracle access, we establish worst-case oracle complexities of in the first case with an -ball-truncated-Gaussian smoothed hard function and in the second case, for reaching an -approximate solution in terms of the optimality gap. Our analysis generalizes previous lower bounds for functions under first- and second-order smoothness as well as those for uniformly convex functions, and furthermore our results match the corresponding upper bounds in this general setting.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext a58c6612-ed51-4859-bfa1-3aed81d7cc1cCited by top-tier papers1
Ask how each one uses itBuilds on2
- The First Optimal Acceleration of High-Order Methods in Smooth Convex OptimizationDmitry Kovalev, Alexander V. GasnikovNeurIPS 2022 · 52 citations
- Near-Optimal Lower Bounds For Convex Optimization For All Orders of SmoothnessAnkit Garg, Robin Kothari, Praneeth Netrapalli, Suhail SherifNeurIPS 2021 · 23 citations
Related papers
- Acceleration with a Ball Optimization OracleYair Carmon, Arun Jambulapati, Qijia Jiang, Yujia Jin et al.NeurIPS 2020 · 58 citations
- Complexity Lower Bounds for Nonconvex-Strongly-Concave Min-Max OptimizationHaochuan Li, Yi Tian, Jingzhao Zhang, Ali JadbabaieNeurIPS 2021 · 62 citations
- Smooth Convex Optimization Using Sub-Zeroth-Order OraclesMustafa O. Karabag, Cyrus Neary, Ufuk TopcuAAAI 2021 · 7 citations
- Dimension-free Complexity Bounds for High-order Nonconvex Finite-sum OptimizationDongruo Zhou, Quanquan GuICML 2022 · 1 citation
- Quantum Speedups for Minimax Optimization and BeyondChengchang Liu, Zongqi Wan, Jialin Zhang, Xiaoming Sun et al.NeurIPS 2025 · 1 citation
