Exploiting Sparsity in Pruned Neural Networks to Optimize Large Model Training
Not on the map. Why?
Abstract (arXiv)
Parallel training of neural networks at scale is challenging due to significant overheads arising from communication. Recently, deep learning researchers have developed a variety of pruning algorithms that are capable of pruning (i.e. setting to zero) 80-90% of the parameters in a neural network to yield sparse subnetworks that equal the accuracy of the unpruned parent network. In this work, we propose a novel approach that exploits these sparse subnetworks to optimize the memory utilization and communication in two popular algorithms for parallel deep learning namely -- data and inter-layer parallelism. We integrate our approach into AxoNN, a highly scalable framework for parallel deep learning that relies on data and inter-layer parallelism, and demonstrate the reduction in communication time and memory utilization. On 512 NVIDIA V100 GPUs, our optimizations reduce the memory consumption of a 2.7 billion parameter model by 74%, and the total communication time by 40%, thus providing an overall speedup of 34% over AxoNN, 32% over DeepSpeed-3D and 46% over Sputnik, a sparse matrix computation baseline.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 36 of its 49 references that are in the map. First posted on arXiv 10 Feb 2023.
Builds on
36 of 49 references.
References · 36
- 2017Attention Is All You Needcited by 59,932
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
- 2016Wide Residual Networkscited by 3,057
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020The Pile: An 800GB Dataset of Diverse Text for Language Modelingcited by 2,346
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2019Megatron-LM: Training Multi-Billion Parameter Language Models Using Model Parallelismcited by 1,829
- 2017Decoupled Weight Decay Regularizationcited by 1,722
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
24 more
- 2016On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minimacited by 1,337
- 2017Mixed Precision Trainingcited by 1,135
- 2015Aligning Books and Movies: Towards Story-like Visual Explanations by Watching Movies and Reading Bookscited by 1,041
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2016Training Deep Nets with Sublinear Memory Costcited by 825
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2019Linear Mode Connectivity and the Lottery Ticket Hypothesiscited by 627
- 2018Rethinking the Value of Network Pruningcited by 595
- 2022Using DeepSpeed and Megatron to Train Megatron-Turing NLG 530B, A Large-Scale Generative Language Modelcited by 557
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2021ZeRO-Infinity: Breaking the GPU Memory Wall for Extreme Scale Deep Learningcited by 253
- 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 206
- 2019Drawing Early-Bird Tickets: Towards More Efficient Training of Deep Networkscited by 160
- 2018Demystifying Parallel and Distributed Deep Learning: An In-Depth Concurrency Analysiscited by 154
- 2020Sparse GPU Kernels for Deep Learningcited by 138
- 2020When BERT Plays the Lottery, All Tickets Are Winningcited by 114
- 2019Learning Fast Algorithms for Linear Transforms Using Butterfly Factorizationscited by 73
- 2019PipeMare: Asynchronous Pipeline Parallel DNN Trainingcited by 54
- 2020Kaleidoscope: An Efficient, Learnable Representation For All Structured Linear Mapscited by 36
- 2020Successfully Applying the Stabilized Lottery Ticket Hypothesis to the Transformer Architecturecited by 23
- 2018Design Principles for Sparse Matrix Multiplication on the GPUcited by 18
- 2021AxoNN: An asynchronous, message-driven parallel framework for extreme-scale deep learningcited by 15
- 2021Towards Understanding Iterative Magnitude Pruning: Why Lottery Tickets Wincited by 11
Built on by
Citing papers per year: 2023: 2; 2024: 1; 2025: 2.
5 papers.
- 2023E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsitycited by 15
- 2024HPC-Coder-V2: Studying Code LLMs Across Low-Resource Parallel Languagescited by 8
- 2023A Comprehensive Performance Study of Large Language Models on Novel AI Acceleratorscited by 7
- 2025Democratizing AI: Open-source Scalable LLM Training on GPU-based Supercomputerscited by 7
- 2025The Big Send-off: Scalable and Performant Collectives for Deep Learningcited by 0
- 2025The Big Send-off: Scalable and Performant Collectives for Deep Learning25 Apr 2025
- 2025Democratizing AI: Open-source Scalable LLM Training on GPU-based Supercomputers12 Feb 2025
- 2024HPC-Coder-V2: Studying Code LLMs Across Low-Resource Parallel Languages19 Dec 2024
- 2023E-Sparse: Boosting the Large Language Model Inference through Entropy-based N:M Sparsity24 Oct 2023
- 2023A Comprehensive Performance Study of Large Language Models on Novel AI Accelerators6 Oct 2023