Improved complexity bounds for second-order convex finite-sum optimization
The paper matches a new lower bound of Omega(n + n^{5/7} eps^{-2/7}) using a Taylor-corrected lazy Newton method with Monteiro-Svaiter acceleration.
1 stories, newest first · one card per story
The paper matches a new lower bound of Omega(n + n^{5/7} eps^{-2/7}) using a Taylor-corrected lazy Newton method with Monteiro-Svaiter acceleration.
Today 1.5K readers · 2.4K views · 757 reads · all time 189K views