arXiv · 1702.05800
Revisiting Distributed Synchronous SGD
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.
Explore related subjects
Keep this discovery
Xinghao Pan, Jianmin Chen, Rajat Monga, Samy Bengio, Rafal Jozefowicz. 2017-02-19. Revisiting Distributed Synchronous SGD. https://arxiv.org/abs/1702.05800
Cite the original work for its findings. Save a collection to share your selection of sources.