Beyond 2:4: exploring V:N:M sparsity for efficient transformer inference on GPUs
Not on the map. Why?
Abstract (arXiv)
To date, 2:4 sparsity has stood as the only sparse pattern that can be accelerated using sparse tensor cores on GPUs. In practice, 2:4 sparsity often possesses low actual speedups (≤ 1.3) and requires fixed sparse ratios, meaning that other ratios, such as 4:8, 8:16, or those exceeding 50% sparsity, do not incur any speedups on GPUs. Recent studies suggest that V:N:M sparsity is promising in addressing these limitations of 2:4 sparsity. However, regarding accuracy, the effects of V:N:M sparsity on broader Transformer models, such as vision Transformers and large language models (LLMs), are largely unexamined. Moreover, Some specific issues related to V:N:M sparsity, such as how to select appropriate V and M values, remain unresolved. In this study, we thoroughly investigate the application of V:N:M sparsity in vision models and LLMs across multiple tasks, from pertaining to downstream tasks. We propose three key approaches to enhance the applicability and accuracy of V:N:M-sparse Transformers, including heuristic V and M selection, V:N:M-specific channel permutation, and three-staged LoRA training techniques. Experimental results show that, with our methods, the DeiT-small achieves lossless accuracy at 64:2:5 sparsity, while the DeiT-base maintains accuracy even at 64:2:8 sparsity. In addition, the fine-tuned LLama2-7B at 64:2:5 sparsity performs comparably or better than training-free 2:4 sparse alternatives on downstream tasks. More importantly, V:N:M-sparse Transformers offer a wider range of speedup-accuracy trade-offs compared to 2:4 sparsity. Overall, our exploration largely facilitates the V:N:M sparsity to act as a truly effective acceleration solution for Transformers in cost-sensitive inference scenarios.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 36 of its 49 references that are in the map. First posted on arXiv 21 Oct 2024.
Builds on
36 of 49 references.
References · 36
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2016Pointer Sentinel Mixture Modelscited by 2,992
- 2021Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutionscited by 1,960
- 2021Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNetcited by 1,096
- 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2023A Simple and Effective Pruning Approach for Large Language Modelscited by 776
- 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 360
- 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 359
24 more
- 2021AutoFormer: Searching Transformers for Visual Recognitioncited by 186
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Learning N:M Fine-grained Structured Sparse Neural Networks From Scratchcited by 177
- 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformercited by 175
- 2021Patch Slimming for Efficient Vision Transformerscited by 131
- 2023RPTQ: Reorder-based Post-training Quantization for Large Language Modelscited by 112
- 2021Accelerated Sparse Neural Training: A Provable and Efficient Method to Find N:M Transposable Maskscited by 103
- 2022Unified Visual Transformer Compressioncited by 79
- 2021Vision Transformer Pruningcited by 77
- 2021Global Vision Transformer Pruning with Hessian-Aware Saliencycited by 69
- 2022Vision Transformer Slimming: Multi-Dimension Searching in Continuous Optimization Spacecited by 66
- 2022Training Your Sparse Neural Network Better with Any Maskcited by 26
- 2023STEP: Learning N:M Structured Sparsity Masks from Scratch with Preconditioncited by 25
- 2023Improving Convergence and Generalization Using Parameter Symmetriescited by 23
- 2021Keep the Gradients Flowing: Using Gradient Flow to Study Sparse Network Optimizationcited by 22
- 2023Boost Vision Transformer with GPU-Friendly Sparsity and Quantizationcited by 20
- 2024Pruning Large Language Models with Semi-Structural Adaptive Sparse Trainingcited by 20
- 2024Progressive Gradient Flow for Robust N:M Sparsity Training in Transformerscited by 17
- 20211xN Pattern for Pruning Convolutional Neural Networkscited by 16
- 2024LPViT: Low-Power Semi-structured Pruning for Vision Transformerscited by 15
- 2023VENOM: A Vectorized N:M Format for Unleashing the Power of Sparse Tensor Corescited by 13
- 2023Bi-directional Masks for Efficient N:M Sparse Trainingcited by 12
- 2023Accurate Neural Network Pruning Requires Rethinking Sparse Optimizationcited by 10
- 2024Level Set Teleportation: An Optimization Perspectivecited by 1
Built on by
Citing papers per year: 2025: 1.
1 paper.