Convergence of Distributed Adaptive Optimization with Local Updates
<|reference_start|>Convergence of Distributed Adaptive Optimization with Local Updates: We study distributed adaptive algorithms with local updates (intermittent communication). Despite the great empirical success of adaptive methods in distributed training of modern machine learning models, the theoretical benefits of local updates within adaptive methods, particularly in terms of reducing communication complexity, have not been fully understood yet. In this paper, we prove that \em Local SGD \em with momentum (\em Local \em SGDM) and \em Local \em Adam can outperform their minibatch counterparts in convex and weakly convex settings, respectively. Our analysis relies on a novel technique to prove contraction during local iterations, which is a crucial but challenging step to show the advantages of local updates, under generalized smoothness assumption and gradient clipping.<|reference_end|>
@article{cheng2024convergence,
    title={Convergence of Distributed Adaptive Optimization with Local Updates},
    author={Ziheng Cheng, Margalit Glasgow},
    journal={arXiv preprint arXiv:2409.13155},
    year={2024},
    archivePrefix={arXiv},
    eprint={2409.13155},
    primaryClass={cs.LG math.OC}
}