The First Optimal Acceleration of High-Order Methods in Smooth Convex Optimization
–Neural Information Processing Systems
In this paper, we study the fundamental open question of finding the optimal highorder algorithm for solving smooth convex minimization problems. Arjevani et al. (2019) established the lower bound Ω (ϵ
Neural Information Processing Systems
May-23-2025, 23:32:48 GMT