Showing math.OCShow all
2 papers · 1 filter
math.OC2026
Finding Stationary Points under Higher-Order Smoothness: Trapping Algorithms and First-Order Lower Bounds
Huanjian Zhou, Masashi Sugiyama, Taiji Suzuki
We study the query complexity of finding approximate stationary points under higher-order smoothness using only function values or only gradients. Our results cover different dimen…
math.OC2025
The Adaptive Complexity of Finding a Stationary Point
Huanjian Zhou, Andi Han, Akiko Takeda +1
In large-scale applications, such as machine learning, it is desirable to design non-convex optimization algorithms with a high degree of parallelization. In this work, we study th…