On the Convergence of SARAH and Beyond

The main theme of this work is a unifying algorithm, LoopLess SARAH (L2S) for problems formulated as summation of n individual loss functions. L2S broadens a recently developed variance reduction method known as SARAH. To find an ε-accurate solution, L2S enjoys a complexity of cal Obig( (n+kappa) ln (1/ε)big) for strongly convex problems. For convex problems, when adopting an n-dependent step size, the complexity of L2S is cal O(n+ √n/ε); while for more frequently adopted n-independent step size, the complexity is cal O(n+ n/ε). Distinct from SARAH, our theoretical findings support an n-independent step size in convex problems without extra assumptions. For nonconvex problems, the complexity of L2S is cal O(n+ √n/ε). Our numerical tests on neural networks suggest that L2S can have better generalization properties than SARAH. Along with L2S, our side results include the linear convergence of the last iteration for SARAH in strongly convex problems.