Near-Optimal Second-Order Convex Finite-Sum Optimization under Individual Smoothness.

arXiv:2610.42040v1 Announce Type: cross Abstract: 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