mlsanityData to 14 Oct 2026

PacTrain: Pruning and Adaptive Sparse Gradient Compression for Efficient Collective Communication in Distributed Deep Learning

arXiv 2505.18563 ↗First posted 24 May 2025cs.DC cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Large-scale deep neural networks (DNN) exhibit excellent performance for various tasks. As DNNs and datasets grow, distributed training becomes extremely time-consuming and demands larger clusters. A main bottleneck is the resulting gradient aggregation overhead. While gradient compression and sparse collective communication techniques are commonly employed to alleviate network load, many gradient compression schemes do not achieve acceleration of the training process while also preserving accuracy. This paper introduces PacTrain, a novel framework that accelerates distributed training by combining pruning with sparse gradient compression. Active pruning of the neural network makes the model weights and gradients sparse. By ensuring the global knowledge of the gradient sparsity among all distributed training workers, we can perform lightweight compression communication without harming accuracy. We show that the PacTrain compression scheme achieves a near-optimal compression strategy while remaining compatible with the all-reduce primitive. Experimental evaluations show that PacTrain improves training throughput by 1.25 to 8.72 times compared to state-of-the-art compression-enabled systems for representative vision and language models training tasks under bandwidth-constrained conditions.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 32 of its 47 references that are in the map. First posted on arXiv 24 May 2025.

Builds on

32 of 47 references.

References · 32

  1. 2015Deep Residual Learning for Image Recognitioncited by 52,096
  2. 2020Language Models are Few-Shot Learnerscited by 32,419
  3. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 30,186
  4. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,364
  5. 2023LLaMA: Open and Efficient Foundation Language Modelscited by 14,132
  6. 2014ImageNet Large Scale Visual Recognition Challengecited by 8,498
  7. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,852
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  9. 2015Learning both Weights and Connections for Efficient Neural Networkscited by 2,031
  10. 2019Similarity of Neural Network Representations Revisitedcited by 1,755
  11. 2022LaMDA: Language Models for Dialog Applicationscited by 1,220
  12. 2016Pruning Filters for Efficient ConvNetscited by 1,143
20 more
  1. 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 478
  2. 2020Picking Winning Tickets Before Training by Preserving Gradient Flowcited by 471
  3. 2017TernGrad: Ternary Gradients to Reduce Communication in Distributed Deep Learningcited by 256
  4. 2017Sparse Communication for Distributed Gradient Descentcited by 249
  5. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 238
  6. 2023Model Sparsity Can Simplify Machine Unlearningcited by 214
  7. 2024MegaScale: Scaling Large Language Model Training to More Than 10,000 GPUscited by 112
  8. 2020EarlyBERT: Efficient BERT Training via Early-bird Lottery Ticketscited by 79
  9. 2024NetLLM: Adapting Large Language Models for Networkingcited by 78
  10. 2023DeepZero: Scaling up Zeroth-Order Optimization for Deep Model Trainingcited by 76
  11. 2021Federated Dynamic Sparse Training: Computing Less, Communicating Less, Yet Learning Bettercited by 55
  12. 2022ZeroFL: Efficient On-Device Training for Federated Learning with Local Sparsitycited by 45
  13. 2021When to Prune? A Policy towards Early Structural Pruningcited by 38
  14. 2023THC: Accelerating Distributed Deep Learning Using Tensor Homomorphic Compressioncited by 15
  15. 2024FedMef: Towards Memory-efficient Federated Dynamic Pruningcited by 14
  16. 2022Distributed Pruning Towards Tiny Neural Networks in Federated Learningcited by 11
  17. 2024Swing: Short-cutting Rings for Higher Bandwidth Allreducecited by 8
  18. 2024Beyond Throughput and Compression Ratios: Towards High End-to-end Utility of Gradient Compressioncited by 6
  19. 2024Optimal and Near-Optimal Adaptive Vector Quantizationcited by 2
  20. 2021EmbRace: Accelerating Sparse Communication for Distributed Training of NLP Neural Networkscited by 1

Built on by

Not cited yet.