mlsanityData to 7 Oct 2026

Accelerating Distributed Deep Learning using Lossless Homomorphic Compression

arXiv 2402.07529 ↗First posted 12 Feb 2024cs.DC cs.DS cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

As deep neural networks (DNNs) grow in complexity and size, the resultant increase in communication overhead during distributed training has become a significant bottleneck, challenging the scalability of distributed training systems. Existing solutions, while aiming to mitigate this bottleneck through worker-level compression and in-network aggregation, fall short due to their inability to efficiently reconcile the trade-offs between compression effectiveness and computational overhead, hindering overall performance and scalability. In this paper, we introduce a novel compression algorithm that effectively merges worker-level compression with in-network aggregation. Our solution is both homomorphic, allowing for efficient in-network aggregation without CPU/GPU processing, and lossless, ensuring no compromise on training accuracy. Theoretically optimal in compression and computational efficiency, our approach is empirically validated across diverse DNN models such as NCF, LSTM, VGG19, and BERT-base, showing up to a 6.33× improvement in aggregation throughput and a 3.74× increase in per-iteration training speed.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 28 of its 49 references that are in the map. First posted on arXiv 12 Feb 2024.

Builds on

28 of 49 references.

References · 28

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2020Language Models are Few-Shot Learnerscited by 32,199
  4. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  5. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  6. 2016SQuAD: 100,000+ Questions for Machine Comprehension of Textcited by 4,115
  7. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  8. 2017Mixed Precision Trainingcited by 1,135
  9. 2017Neural Collaborative Filteringcited by 1,108
  10. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  11. 2013One Billion Word Benchmark for Measuring Progress in Statistical Language Modelingcited by 302
  12. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 253
16 more
  1. 2022Compute Trends Across Three Eras of Machine Learningcited by 161
  2. 2018Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysiscited by 154
  3. 2019The Architectural Implications of Facebook's DNN-based Personalized Recommendationcited by 83
  4. 2017Comparative Study of CNN and RNN for Natural Language Processingcited by 81
  5. 2019Communication-efficient distributed SGD with Sketchingcited by 81
  6. 2019Scaling Distributed Machine Learning with In-Network Aggregationcited by 62
  7. 20158-Bit Approximations for Parallelism in Deep Learningcited by 56
  8. 2019A Distributed Synchronous SGD Algorithm with Global Top-k Sparsification for Low Bandwidth Networkscited by 36
  9. 2018SparCML: High-Performance Sparse Communication for Machine Learningcited by 34
  10. 2022Near-Optimal Sparse Allreduce for Distributed Deep Learningcited by 23
  11. 2018Parameter Hub: a Rack-Scale Parameter Server for Distributed Deep Neural Network Trainingcited by 17
  12. 2023THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compressioncited by 15
  13. 2019Optimizing Network Performance for Distributed DNN Training on GPU Clusters: ImageNet/AlexNet Training in 1.5 Minutescited by 13
  14. 2023ChainedFilter: Combining Membership Filters by Chain Rulecited by 3
  15. 2013Parallel Peeling Algorithmscited by 1
  16. 2017Homomorphic Parameter Compression for Distributed Deep Learning Trainingcited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 1; 2026: 1.

4 papers.