Communication-efficient SGD: From Local SGD to One-Shot Averaging

We consider speeding up stochastic gradient descent (SGD) by parallelizing it across multiple workers. We assume the same data set is shared among N workers, who can take SGD steps and coordinate with a central server. While it is possible to obtain a linear reduction in the variance by averaging all the stochastic gradients at every step, this requires a lot of communication between the workers and the server, which can dramatically reduce the gains from parallelism. The Local SGD method, proposed and analyzed in the earlier literature, suggests machines should make many local steps between such communications. While the initial analysis of Local SGD showed it needs Ω( √ T ) communications for T local gradient steps in order for the error to scale proportionately to 1/(N T ), this has been successively improved in a string of papers, with the state of the art requiring Ω (N ( poly(log T ))) communications. In this paper, we suggest a Local SGD scheme that communicates less overall by communicating less frequently as the number of iterations grows. Our analysis shows that this can achieve an error that scales as 1/(N T ) with a number of communications that is completely independent of T . In particular, we show that Ω(N ) communications are sufficient. Empirical evidence suggests this bound is close to tight as we further show that √ N or N 3/4 communications fail to achieve linear speed-up in simulations. Moreover, we show that under mild assumptions, the main of which is twice differentiability on any neighborhood of the optimal solution, one-shot averaging which only uses a single round of communication can also achieve the optimal convergence rate asymptotically. Woodworth et al. (2020) O exp. decay uniform with strong-growth a Depending on the work, xT is either the last iterate or a weighted average of iterates up to T . b G is the uniform upper bound assumed for the l 2 norm of gradients in the corresponding work. c This noise model is defined in Assumption 5. d Õ(.) ignores the poly-logarithmic and constant factors. e This is the bound for FedAC-II. FedAC-I requires R = Ω(N 1/2 * poly(log T )). f c is the multiplicative factor in the noise model defined in Assumption 5.