oracle-complexity

Tag

Cards List
#oracle-complexity

Sharp First-Order Lower Bounds for Higher-Order Smooth Nonconvex Optimization

arXiv cs.LG · 2026-06-05 Cached

This paper proves sharp dimension-free first-order lower bounds for finding epsilon-stationary points in higher-order smooth nonconvex optimization, resolving open problems for Hessian-Lipschitz and third-order smooth cases.

0 favorites 0 likes
← Back to home

Submit Feedback