Tighter Theory for Local SGD on Identical and Heterogeneous Data
Machine Learning
2022-04-18 v4 Distributed, Parallel, and Cluster Computing
Numerical Analysis
Numerical Analysis
Optimization and Control
Machine Learning
Abstract
We provide a new analysis of local SGD, removing unnecessary assumptions and elaborating on the difference between two data regimes: identical and heterogeneous. In both cases, we improve the existing theory and provide values of the optimal stepsize and optimal number of local iterations. Our bounds are based on a new notion of variance that is specific to local SGD methods with different data. The tightness of our results is guaranteed by recovering known statements when we plug , where is the number of local steps. The empirical evidence further validates the severe impact of data heterogeneity on the performance of local SGD.
Keywords
Cite
@article{arxiv.1909.04746,
title = {Tighter Theory for Local SGD on Identical and Heterogeneous Data},
author = {Ahmed Khaled and Konstantin Mishchenko and Peter Richtárik},
journal= {arXiv preprint arXiv:1909.04746},
year = {2022}
}
Comments
AISTATS 2020. 31 pages, 1 algorithm, 5 theorems, 6 figures