English

Revisiting Distributed Synchronous SGD

Distributed, Parallel, and Cluster Computing 2017-03-21 v2 Artificial Intelligence Machine Learning

Abstract

Distributed training of deep learning models on large-scale training data is typically conducted with asynchronous stochastic optimization to maximize the rate of updates, at the cost of additional noise introduced from asynchrony. In contrast, the synchronous approach is often thought to be impractical due to idle time wasted on waiting for straggling workers. We revisit these conventional beliefs in this paper, and examine the weaknesses of both approaches. We demonstrate that a third approach, synchronous optimization with backup workers, can avoid asynchronous noise while mitigating for the worst stragglers. Our approach is empirically validated and shown to converge faster and to better test accuracies.

Keywords

Cite

@article{arxiv.1702.05800,
  title  = {Revisiting Distributed Synchronous SGD},
  author = {Xinghao Pan and Jianmin Chen and Rajat Monga and Samy Bengio and Rafal Jozefowicz},
  journal= {arXiv preprint arXiv:1702.05800},
  year   = {2017}
}

Comments

This article will be superseded by arXiv:1604.00981

R2 v1 2026-06-22T18:22:30.162Z