Near-Optimal Second-Order Convex Finite-Sum Optimization under Individual Smoothness
We study the stochastic second-order oracle complexity of solving smooth convex finite-sum optimization with $n$ components. Very recently, Tsedenov \& Kovalev (2026) showed that the minimax optimal complexity under averaged smoothness and convexity is $\tilde{\Theta}(n + n^{6/7} \epsilon^{-2/7})$…
By Xinliang Zhang, Lesi Chen, Zonghan Li, Jingzhao ZhangarXiv - stat.ML
Read the full story
Originally published by arXiv - stat.ML on Nov 2, 2026.
Comments
Sign in to join the discussion.