MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling
Abstract
This paper studies the problem of error-runtime trade-off, typically encountered in decentralized training based on stochastic gradient descent (SGD) using a given network. While a denser (sparser) network topology results in faster (slower) error convergence in terms of iterations, it incurs more (less) communication time/delay per iteration. In this paper, we propose MATCHA, an algorithm that can achieve a win-win in this error-runtime trade-off for any arbitrary network topology. The main idea of MATCHA is to parallelize inter-node communication by decomposing the topology into matchings. To preserve fast error convergence speed, it identifies and communicates more frequently over critical links, and saves communication time by using other links less frequently. Experiments on a suite of datasets and deep neural networks validate the theoretical analyses and demonstrate that MATCHA takes up to less time than vanilla decentralized SGD to reach the same training loss.
Cite
@article{arxiv.1905.09435,
title = {MATCHA: Speeding Up Decentralized SGD via Matching Decomposition Sampling},
author = {Jianyu Wang and Anit Kumar Sahu and Zhouyi Yang and Gauri Joshi and Soummya Kar},
journal= {arXiv preprint arXiv:1905.09435},
year = {2019}
}