Sharper Convergence Guarantees for Asynchronous SGD for Distributed and Federated Learning

We study the asynchronous stochastic gradient descent algorithm for distributed training over n workers which have varying computation and communication frequency over time. In this algorithm, workers compute stochastic gradients in parallel at their own pace and return those to the server without any synchronization. Existing convergence rates of this algorithm for non-convex smooth objectives depend on the maximum gradient delay τ max and show that an ε-stationary point is reached after O σ 2 ε -2 + τ max ε -1 iterations, where σ denotes the variance of stochastic gradients. In this work (i) we obtain a tighter convergence rate of O σ 2 ε -2 + √ τ max τ avg ε -1 without any change in the algorithm where τ avg is the average delay, which can be significantly smaller than τ max . We also provide (ii) a simple delay-adaptive learning rate scheme, under which asynchronous SGD achieves a convergence rate of O σ 2 ε -2 + τ avg ε -1 , and does not require any extra hyperparameter tuning nor extra communications. Our result allows to show for the first time that asynchronous SGD is always faster than mini-batch SGD. In addition, (iii) we consider the case of heterogeneous functions motivated by federated learning applications and improve the convergence rate by proving a weaker dependence on the maximum delay compared to prior works. In particular, we show that the heterogeneity term in convergence rate is only affected by the average delay within each worker. Assumptions. For our convergence analysis we rely on following standard assumptions on the functions f i and F i : Assumption 1 (bounded variance). We assume that there exists a constant σ ≥ 0 such that (2)