Lune

ICLR2025顶会

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

Site Bai, Brian Bullins

2025年份
1顶会引用

摘要

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.

问问这篇 Paper

智能体会读完全文。

Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。

可以从这些问题问起

智能体调用

Luneget_paper_fulltext

在 Lune 里问

免费开始,无需绑卡

引用它的顶会 Paper1

问问它们各自怎么用它

它引用的顶会 Paper2

相关 Paper

黄昏的海面,两侧是细线勾勒的悬崖