mlsanityData to 7 Oct 2026

GraVAC: Adaptive Compression for Communication-Efficient Distributed DL Training

arXiv 2305.12201 ↗First posted 20 May 2023cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

Distributed data-parallel (DDP) training improves overall application throughput as multiple devices train on a subset of data and aggregate updates to produce a globally shared model. The periodic synchronization at each iteration incurs considerable overhead, exacerbated by the increasing size and complexity of state-of-the-art neural networks. Although many gradient compression techniques propose to reduce communication cost, the ideal compression factor that leads to maximum speedup or minimum data exchange remains an open-ended problem since it varies with the quality of compression, model size and structure, hardware, network topology and bandwidth. We propose GraVAC, a framework to dynamically adjust compression factor throughout training by evaluating model progress and assessing gradient information loss associated with compression. GraVAC works in an online, black-box manner without any prior assumptions about a model or its hyperparameters, while achieving the same or better accuracy than dense SGD (i.e., no compression) in the same number of iterations/epochs. As opposed to using a static compression factor, GraVAC reduces end-to-end training time for ResNet101, VGG16 and LSTM by 4.32x, 1.95x and 6.67x respectively. Compared to other adaptive schemes, our framework provides 1.94x to 5.63x overall speedup.

Key facts. Cited by 10 papers in the map (data through 7 Oct 2026). Builds on 26 of its 39 references that are in the map. First posted on arXiv 20 May 2023.

Builds on

26 of 39 references.

References · 26

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  4. 2017Mixed Precision Trainingcited by 1,135
  5. 2016An overview of gradient descent optimization algorithmscited by 1,021
  6. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  7. 2019Error Feedback Fixes SignSGD and other Gradient Compression Schemescited by 306
  8. 2018An Empirical Model of Large-Batch Trainingcited by 268
  9. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 234
  10. 2018The Convergence of Sparsified Gradient Methodscited by 228
  11. 2016Eigenvalues of the Hessian in Deep Learning: Singularity and Beyondcited by 156
  12. 2020The Early Phase of Neural Network Trainingcited by 114
14 more
  1. 2020PyTorch Distributed: Experiences on Accelerating Data Parallel Trainingcited by 87
  2. 2017Critical Learning Periods in Deep Neural Networkscited by 78
  3. 2020Pollux: Co-adaptive Cluster Scheduling for Goodput-Optimized Deep Learningcited by 68
  4. 2021Pufferfish: Communication-efficient Models At No Extra Costcited by 61
  5. 2019Understanding Top-k Sparsification in Distributed Deep Learningcited by 56
  6. 2019Communication-Efficient Distributed Blockwise Momentum SGD with Error-Feedbackcited by 49
  7. 2021An Efficient Statistical-based Gradient Compression Technique for Distributed Training Systemscited by 32
  8. 2021On the Utility of Gradient Compression in Distributed Training Systemscited by 26
  9. 2020Is Network the Bottleneck of Distributed Training?cited by 19
  10. 2020Accordion: Adaptive Gradient Communication via Critical Learning Regime Identificationcited by 19
  11. 2020AdaScale SGD: A User-Friendly Algorithm for Distributed Trainingcited by 16
  12. 2023ScaDLES: Scalable Deep Learning over Streaming data at the Edgecited by 8
  13. 2023Scavenger: A Cloud Service for Optimizing Cost and Performance of ML Trainingcited by 5
  14. 2018RedSync : Reducing Synchronization Traffic for Distributed Deep Learningcited by 2

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 2; 2025: 3; 2026: 3.

10 papers.