mlsanityData to 14 Oct 2026

Compressed Communication for Distributed Training: Adaptive Methods and System

arXiv 2105.07829 ↗First posted 17 May 2021cs.DC cs.LG stat.MLcited by 5

Not on the map. Why?

Abstract (arXiv)

Communication overhead severely hinders the scalability of distributed machine learning systems. Recently, there has been a growing interest in using gradient compression to reduce the communication overhead of the distributed training. However, there is little understanding of applying gradient compression to adaptive gradient methods. Moreover, its performance benefits are often limited by the non-negligible compression overhead. In this paper, we first introduce a novel adaptive gradient method with gradient compression. We show that the proposed method has a convergence rate of O(1/√T) for non-convex problems. In addition, we develop a scalable system called BytePS-Compress for two-way compression, where the gradients are compressed in both directions between workers and parameter servers. BytePS-Compress pipelines the compression and decompression on CPUs and achieves a high degree of parallelism. Empirical evaluations show that we improve the training time of ResNet50, VGG16, and BERT-base by 5.0%, 58.1%, 23.3%, respectively, without any accuracy loss with 25 Gb/s networking. Furthermore, for training the BERT models, we achieve a compression rate of 333x compared to the mixed-precision training.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 26 of its 42 references that are in the map. First posted on arXiv 17 May 2021.

Builds on

26 of 42 references.

References · 26

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020Language Models are Few-Shot Learnerscited by 32,419
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  5. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  6. 2020Scaling Laws for Neural Language Modelscited by 6,586
  7. 2016Identity Mappings in Deep Residual Networkscited by 1,965
  8. 2019On the Convergence of Adam and Beyondcited by 841
  9. 2019Large Batch Optimization for Deep Learning: Training BERT in 76 minutescited by 674
  10. 2018signSGD: Compressed Optimisation for Non-Convex Problemscited by 571
  11. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
  12. 2018Sparsified SGD with Memorycited by 376
14 more
  1. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 310
  2. 2018Horovod: fast and easy distributed deep learning in TensorFlowcited by 279
  3. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 256
  4. 2017Sparse Communication for Distributed Gradient Descentcited by 249
  5. 2017Gradient Sparsification for Communication-Efficient Distributed Optimizationcited by 201
  6. 2019Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification, and Local Computationscited by 181
  7. 2019Natural Compression for Distributed Deep Learningcited by 90
  8. 2019Communication-Efficient Distributed Blockwise Momentum SGD with Error-Feedbackcited by 50
  9. 2020A Better Alternative to Error Feedback for Communication-Efficient Distributed Learningcited by 43
  10. 2019GluonCV and GluonNLP: Deep Learning in Computer Vision and Natural Language Processingcited by 32
  11. 2021An Efficient Statistical-based Gradient Compression Technique for Distributed Training Systemscited by 32
  12. 2020CSER: Communication-efficient SGD with Error Resetcited by 27
  13. 2020Accelerated Large Batch Optimization of BERT Pretraining in 54 minutescited by 7
  14. 2020APMSqueeze: A Communication Efficient Adam-Preconditioned Momentum SGD Algorithmcited by 6

Built on by

Cited by year

Citing papers per year: 2021: 2; 2022: 3.

5 papers.