mlsanityData to 7 Oct 2026

Preserving Near-Optimal Gradient Sparsification Cost for Scalable Distributed Deep Learning

arXiv 2402.13781 ↗First posted 21 Feb 2024cs.LG cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

Communication overhead is a major obstacle to scaling distributed training systems. Gradient sparsification is a potential optimization approach to reduce the communication volume without significant loss of model fidelity. However, existing gradient sparsification methods have low scalability owing to inefficient design of their algorithms, which raises the communication overhead significantly. In particular, gradient build-up and inadequate sparsity control methods degrade the sparsification performance considerably. Moreover, communication traffic increases drastically owing to workload imbalance of gradient selection between workers. To address these challenges, we propose a novel gradient sparsification scheme called ExDyna. In ExDyna, the gradient tensor of the model comprises fined-grained blocks, and contiguous blocks are grouped into non-overlapping partitions. Each worker selects gradients in its exclusively allocated partition so that gradient build-up never occurs. To balance the workload of gradient selection between workers, ExDyna adjusts the topology of partitions by comparing the workloads of adjacent partitions. In addition, ExDyna supports online threshold scaling, which estimates the accurate threshold of gradient selection on-the-fly. Accordingly, ExDyna can satisfy the user-required sparsity level during a training period regardless of models and datasets. Therefore, ExDyna can enhance the scalability of distributed training systems by preserving near-optimal gradient sparsification cost. In experiments, ExDyna outperformed state-of-the-art sparsifiers in terms of training speed and sparsification performance while achieving high accuracy.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 32 references that are in the map. First posted on arXiv 21 Feb 2024.

Builds on

21 of 32 references.

References · 21

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  3. 2017Squeeze-and-Excitation Networkscited by 4,763
  4. 2014Going Deeper with Convolutionscited by 4,231
  5. 2016Pointer Sentinel Mixture Modelscited by 2,992
  6. 2016Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learningcited by 1,509
  7. 2023PaLM 2 Technical Reportcited by 1,154
  8. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
  9. 2018The Convergence of Sparsified Gradient Methodscited by 228
  10. 2019Are All Layers Created Equal?cited by 94
  11. 2019Natural Compression for Distributed Deep Learningcited by 88
  12. 2021Rethinking gradient sparsification as total error minimizationcited by 41
9 more
  1. 2019A Distributed Synchronous SGD Algorithm with Global Top-k Sparsification for Low Bandwidth Networkscited by 36
  2. 2017AdaComp : Adaptive Residual Gradient Compression for Data-Parallel Distributed Trainingcited by 33
  3. 2021An Efficient Statistical-based Gradient Compression Technique for Distributed Training Systemscited by 32
  4. 2022Near-Optimal Sparse Allreduce for Distributed Deep Learningcited by 23
  5. 2021ScaleCom: Scalable Sparsified Gradient Compression for Communication-Efficient Distributed Trainingcited by 22
  6. 2021Learned Gradient Compression for Distributed Deep Learningcited by 20
  7. 2019Layer-wise Adaptive Gradient Sparsification for Distributed Deep Learning with Convergence Guaranteescited by 8
  8. 2023Evaluation and Optimization of Gradient Compression for Distributed Deep Learningcited by 7
  9. 2021ErrorCompensatedX: error compensation for variance reduced algorithmscited by 5

Built on by

Not cited yet.