A Universally Optimal Multistage Accelerated Stochastic Gradient Method

01/23/2019
by   Necdet Serhat Aybat, et al.
0

We study the problem of minimizing a strongly convex and smooth function when we have noisy estimates of its gradient. We propose a novel multistage accelerated algorithm that is universally optimal in the sense that it achieves the optimal rate both in the deterministic and stochastic case and operates without knowledge of noise characteristics. The algorithm consists of stages that use a stochastic version of Nesterov's accelerated algorithm with a specific restart and parameters selected to achieve the fastest reduction in the bias-variance terms in the convergence rate bounds.

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset