Establishes matching Ω(ε^{-7/4}) and Ω(ε^{-5/3}) lower bounds via a block-chain construction for deterministic first-order methods under higher-order smoothness.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization
Establishes matching Ω(ε^{-7/4}) and Ω(ε^{-5/3}) lower bounds via a block-chain construction for deterministic first-order methods under higher-order smoothness.