---
abstract: 'In this paper, we show that SVRG and SARAH can be modified to be fundamentally faster than all of the other standard algorithms that
have been proposed for solving the problem of minimizing a smooth convex function over a convex set. We also show that the modified algorithms are fundamentally faster than the state-of-the-art algorithms for solving the problem of minimizing a smooth convex function over a convex set. We also show that the modified algorithms are fundamentally faster than