TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learning
Wei Wen, Cong Xu, Feng Yan, Chunpeng Wu, Yandan Wang, Yiran Chen, Hai Li
TL;DR
The paper addresses the bottleneck of gradient communication in distributed data-parallel training by introducing TernGrad, which quantizes gradients to ternary values and uses a shared scaler along with parameter localization to reduce communication. It provides a convergence analysis under a gradient-bound assumption and offers practical improvements via layer-wise ternarizing and gradient clipping. Empirical results across MNIST, CIFAR-10, and ImageNet demonstrate near-baseline accuracy with significant communication-time reductions and substantial throughput gains, especially for networks with high communication-to-computation ratios. A performance model further quantifies scalability and speedups on GPU clusters under various network configurations.
Abstract
High network communication cost for synchronizing gradients and parameters is the well-known bottleneck of distributed training. In this work, we propose TernGrad that uses ternary gradients to accelerate distributed deep learning in data parallelism. Our approach requires only three numerical levels {-1,0,1}, which can aggressively reduce the communication time. We mathematically prove the convergence of TernGrad under the assumption of a bound on gradients. Guided by the bound, we propose layer-wise ternarizing and gradient clipping to improve its convergence. Our experiments show that applying TernGrad on AlexNet does not incur any accuracy loss and can even improve accuracy. The accuracy loss of GoogLeNet induced by TernGrad is less than 2% on average. Finally, a performance model is proposed to study the scalability of TernGrad. Experiments show significant speed gains for various deep neural networks. Our source code is available.
