Nested Dithered Quantization for Communication Reduction in Distributed Training
Not on the map. Why?
Abstract (arXiv)
In distributed training, the communication cost due to the transmission of gradients or the parameters of the deep model is a major bottleneck in scaling up the number of processing nodes. To address this issue, we propose dithered quantization for the transmission of the stochastic gradients and show that training with Dithered Quantized Stochastic Gradients (DQSG) is similar to the training with unquantized SGs perturbed by an independent bounded uniform noise, in contrast to the other quantization methods where the perturbation depends on the gradients and hence, complicating the convergence analysis. We study the convergence of training algorithms using DQSG and the trade off between the number of quantization levels and the training time. Next, we observe that there is a correlation among the SGs computed by workers that can be utilized to further reduce the communication overhead without any performance loss. Hence, we develop a simple yet effective quantization scheme, nested dithered quantized SG (NDQSG), that can reduce the communication significantly without requiring the workers communicating extra information to each other. We prove that although NDQSG requires significantly less bits, it can achieve the same quantization variance bound as DQSG. Our simulation results confirm the effectiveness of training using DQSG and NDQSG in reducing the communication bits or the convergence time compared to the existing methods without sacrificing the accuracy of the trained model.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). First posted on arXiv 2 Apr 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 0; 2023: 1; 2024: 0; 2025: 1.
4 papers.
- 2021FEDZIP: A Compression Framework for Communication-Efficient Federated Learningcited by 27
- 2021Learned Gradient Compression for Distributed Deep Learningcited by 20
- 2025Remote Inference over Dynamic Links via Adaptive Rate Deep Task-Oriented Vector Quantizationcited by 3
- 2023DISCO: Distributed Inference with Sparse Communicationscited by 2
- 2025Remote Inference over Dynamic Links via Adaptive Rate Deep Task-Oriented Vector Quantization5 Jan 2025
- 2023DISCO: Distributed Inference with Sparse Communications22 Feb 2023
- 2021Learned Gradient Compression for Distributed Deep Learning16 Mar 2021
- 2021FEDZIP: A Compression Framework for Communication-Efficient Federated Learning2 Feb 2021