New algorithm speeds up convex optimization with sharper smoothness assumptions

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

Source: arxiv.org ↗