Lune

ICLR2025Top-tier venue

Tight Lower Bounds under Asymmetric High-Order Hölder Smoothness and Uniform Convexity

Site Bai, Brian Bullins

2025Year
1Top-tier citations

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 pthp^{th}-order derivatives are Hölder continuous with degree νν and parameter HH, and that is uniformly convex with degree qq and parameter σσ, we focus on two asymmetric cases: (1) q > p + ν, and (2) q < p+ν. Given up to pthp^{th}-order oracle access, we establish worst-case oracle complexities of Ω((Hσ)23(p+ν)−2(σε)2(q−p−ν)q(3(p+ν)−2))Ω\left( \left( \frac{H}σ\right)^\frac{2}{3(p+ν)-2}\left( \fracσε\right)^\frac{2(q-p-ν)}{q(3(p+ν)-2)}\right) in the first case with an ℓ∞\ell_\infty-ball-truncated-Gaussian smoothed hard function and Ω((Hσ)23(p+ν)−2+log⁡log⁡((σp+νHq)1p+ν−q1ε))Ω\left(\left(\frac{H}σ\right)^\frac{2}{3(p+ν)-2}+ \log\log\left(\left(\frac{σ^{p+ν}}{H^q}\right)^\frac{1}{p+ν-q}\frac{1}ε\right)\right) 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.

Questions to start from

Your agent calls

Luneget_paper_fulltext

Ask in Lune

Free to start. No credit card required.

lune papers fulltext a58c6612-ed51-4859-bfa1-3aed81d7cc1c

Cited by top-tier papers1

Ask how each one uses it

Builds on2

Related papers

Dusk over the sea between two cliffs drawn in fine vertical lines