Model Accuracy and Runtime Tradeoff in Distributed Deep Learning: A Systematic Study
Suyog Gupta1,∗, Wei Zhang1,∗, Fei Wang2 Affiliation: 1IBM T. J. Watson Research Center. Yorktown Heights. NY. ∗Equal Contribution. 2Department of Healthcare Policy and Research, Weill Cornell Medical College. New York City. NY
Abstract
Deep learning with a large number of parameters requires distributed training, where model accuracy and runtime are two important factors to be considered. However, there has been no systematic study of the tradeoff between these two factors during the model training process. This paper presents Rudra, a parameter server based distributed computing framework tuned for training large-scale deep neural networks. Using variants of the asynchronous stochastic gradient descent algorithm we study the impact of synchronization protocol, stale gradient updates, minibatch size, learning rates, and number of learners on runtime performance and model accuracy. We introduce a new learning rate modulation strategy to counter the effect of stale gradients and propose a new synchronization protocol that can effectively bound the staleness in gradients, improve runtime performance and achieve good model accuracy. Our empirical investigation reveals a principled approach for distributed training of neural networks: the mini-batch size per learner should be reduced as more learners are added to the system to preserve the model accuracy. We validate this approach using commonly-used image classificat
原文 arXiv:1509.04210;中英对照 + 大白话阅读 https://aha.fim.ai/paper/1509.04210v3