STen: Productive and Efficient Sparsity in PyTorch
Not on the map. Why?
Abstract (arXiv)
As deep learning models grow, sparsity is becoming an increasingly critical component of deep neural networks, enabling improved performance and reduced storage. However, existing frameworks offer poor support for sparsity. Specialized sparsity engines focus exclusively on sparse inference, while general frameworks primarily focus on sparse tensors in classical formats and neglect the broader sparsification pipeline necessary for using sparse models, especially during training. Further, existing frameworks are not easily extensible: adding a new sparse tensor format or operator is challenging and time-consuming. To address this, we propose STen, a sparsity programming model and interface for PyTorch, which incorporates sparsity layouts, operators, and sparsifiers, in an efficient, customizable, and extensible framework that supports virtually all sparsification methods. We demonstrate this by developing a high-performance grouped n:m sparsity layout for CPU inference at moderate sparsity. STen brings high performance and ease of use to the ML community, making sparsity easily accessible.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 65 of its 111 references that are in the map. First posted on arXiv 15 Apr 2023.
Builds on
65 of 111 references.
References · 65
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2020Language Models are Few-Shot Learnerscited by 32,199
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
- 2020Scaling Laws for Neural Language Modelscited by 6,411
- 2022PaLM: Scaling Language Modeling with Pathwayscited by 5,304
- 2022OPT: Open Pre-trained Transformer Language Modelscited by 3,464
- 2016Wide Residual Networkscited by 3,057
- 2021Switch Transformers: Scaling to Trillion Parameter Models with Simple and Efficient Sparsitycited by 3,014
- 2022Training Compute-Optimal Large Language Modelscited by 2,927
- 2019ALBERT: A Lite BERT for Self-supervised Learning of Language Representationscited by 2,772
38 more
- 2015Deep Compression: Compressing Deep Neural Networks with Pruning, Trained Quantization and Huffman Codingcited by 2,291
- 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
- 2022GPTQ: Accurate Post-Training Quantization for Generative Pre-trained Transformerscited by 1,838
- 2020Big Bird: Transformers for Longer Sequencescited by 1,673
- 2020Knowledge Distillation: A Surveycited by 1,578
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2016Pruning Filters for Efficient ConvNetscited by 1,129
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2021GLaM: Efficient Scaling of Language Models with Mixture-of-Expertscited by 890
- 2021A Survey of Quantization Methods for Efficient Neural Network Inferencecited by 798
- 2017To prune, or not to prune: exploring the efficacy of pruning for model compressioncited by 596
- 2022Efficiently Scaling Transformer Inferencecited by 529
- 2021Sparsity in Deep Learning: Pruning and growth for efficient inference and training in neural networkscited by 521
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
- 2017Deep Gradient Compression: Reducing the Communication Bandwidth for Distributed Trainingcited by 471
- 2019The State of Sparsity in Deep Neural Networkscited by 471
- 2020Movement Pruning: Adaptive Sparsity by Fine-Tuningcited by 398
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2019Sparse Networks from Scratch: Faster Training without Losing Performancecited by 210
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2022Compute Trends Across Three Eras of Machine Learningcited by 161
- 2018Learning to Optimize Tensor Programscited by 138
- 2020Sparse GPU Kernels for Deep Learningcited by 138
- 2017Bayesian Compression for Deep Learningcited by 116
- 2020Data Movement Is All You Need: A Case Study on Optimizing Transformerscited by 108
- 2022Monarch: Expressive Structured Matrices for Efficient and Accurate Trainingcited by 100
- 2019Fast Sparse ConvNetscited by 86
- 2020Stable Low-rank Tensor Decomposition for Compression of Convolutional Neural Networkcited by 74
- 2022GradMax: Growing Neural Networks using Gradient Informationcited by 64
- 2019The Difficulty of Training Sparse Neural Networkscited by 62
- 2016ESE: Efficient Speech Recognition Engine with Sparse LSTM on FPGAcited by 50
- 2022SparseTIR: Composable Abstractions for Sparse Compilation in Deep Learningcited by 47
- 2020GE-SpMM: General-purpose Sparse Matrix-Matrix Multiplication on GPUs for Graph Neural Networkscited by 42
- 2019PruneTrain: Fast Neural Network Training by Dynamic Sparse Model Reconfigurationcited by 41
- 2016Faster CNNs with Direct Sparse Convolutions and Guided Pruningcited by 39
- 2022Machine Learning Model Sizes and the Parameter Gapcited by 39
- 2020FeatGraph: A Flexible and Efficient Backend for Graph Neural Network Systemscited by 36
- 2018SparCML: High-Performance Sparse Communication for Machine Learningcited by 34
50 most cited of 65 All 65 (JSON)
Built on by
Citing papers per year: 2025: 1.
1 paper.