Tight Lower Bounds under Matched High-Order H\"older Smoothness and Uniform Convexity

arXiv:2611.05527v1 Announce Type: new Abstract: In this paper, we provide tight lower bounds for minimizing high-order H\"older-smooth and uniformly convex functions when their orders match. Specifically, we consider functions whose $p^{th}$-order derivatives are H\"older continuous with degree $\nu$ and parameter $H$, and that are uniformly convex with degree $q$ and parameter $\sigma$. When these orders match, namely, $q = p + \nu$, we show that any deterministic algorithm with access to derivatives up to order $p$ requires $\Omega\left(\left(\frac{H}{\sigma}\right)^{\frac{2}{3(p+\nu)-2}}\log\frac{\Delta_0}{\epsilon}\right)$ oracle calls to reduce an initial optimality gap of $\Delta_0$ to $\epsilon$. This matches the corresponding upper bound and establishes a higher-order uniformly convex counterpart to Nesterov's classical first-order lower bound for strongly convex functions. Rather than directly generalizing Nesterov's classical quadratic-chain construction, we develop a multiscale phase-wise construction that preserves previous oracle responses while maintaining global H\"older smoothness and uniform convexity. Our result resolves the matched case left open by existing lower bounds for the two asymmetric regimes.

You are being forwarded in 6s — stay on this page