Communication-Efficient Stochastic Gradient Descent, with Applications to Neural Networks
Communication-Efficient Stochastic Gradient Descent, with Applications to Neural Networks
复制标题
通信高效的随机梯度下降及其在神经网络中的应用
DOI:
--
复制
发表时间:
2017
期刊:
影响因子:
--
通讯作者:
M. Vojnović
中科院分区:
文献类型:
--
作者:
Dan Alistarh;Demjan Grubic;Jerry Liu;Ryota Tomioka;M. Vojnović
Parallel implementations of stochastic gradient descent (SGD) have received significant research attention, thanks to its excellent scalability properties. A fundamental barrier when parallelizing SGD is the high bandwidth cost of communicating gradient updates between nodes; consequently, several lossy compresion heuristics have been proposed, by which nodes only communicate quantized gradients. Although effective in practice, these heuristics do not always guarantee convergence, and it is not clear whether they can be improved. In this paper, we propose Quantized SGD (QSGD), a family of compression schemes for gradient updates which provides convergence guarantees. QSGD allows the user to smoothly trade off emph{communication bandwidth} and emph{convergence time}: nodes can adjust the number of bits sent per iteration, at the cost of possibly higher variance. We show that this trade-off is inherent, in the sense that improving it past some threshold would violate information-theoretic lower bounds. QSGD guarantees convergence for convex and non-convex objectives, under asynchrony, and can be extended to stochastic variance-reduced techniques. When applied to training deep neural networks for image classification and automated speech recognition, QSGD leads to significant reductions in end-to-end training time. For example, on 16GPUs, we can train the ResNet152 network to full accuracy on ImageNet 1.8x faster than the full-precision variant.