Kevin Kurian Thomas Vaidyan

Convergence Rate of the Last Iterate of Stochastic Proximal Algorithms

We analyze two classical algorithms for solving additively composite convex optimization problems where the objective is the sum of a smooth term and a nonsmooth regularizer: proximal stochastic gradient method for a single regularizer; and the randomized incremental proximal method, which uses the …