ELSA: Exploiting Layer-wise N:M Sparsity for Vision Transformer Acceleration
Not on the map. Why?
Abstract (arXiv)
N:M sparsity is an emerging model compression method supported by more and more accelerators to speed up sparse matrix multiplication in deep neural networks. Most existing N:M sparsity methods compress neural networks with a uniform setting for all layers in a network or heuristically determine the layer-wise configuration by considering the number of parameters in each layer. However, very few methods have been designed for obtaining a layer-wise customized N:M sparse configuration for vision transformers (ViTs), which usually consist of transformer blocks involving the same number of parameters. In this work, to address the challenge of selecting suitable sparse configuration for ViTs on N:M sparsity-supporting accelerators, we propose ELSA, Exploiting Layer-wise N:M Sparsity for ViTs. Considering not only all N:M sparsity levels supported by a given accelerator but also the expected throughput improvement, our methodology can reap the benefits of accelerators supporting mixed sparsity by trading off negligible accuracy loss with both memory usage and inference time reduction for ViT models. For instance, our approach achieves a noteworthy 2.9× reduction in FLOPs for both Swin-B and DeiT-B with only a marginal degradation of accuracy on ImageNet. Our code will be released upon paper acceptance.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 42 references that are in the map. First posted on arXiv 15 Sep 2024.
Builds on
31 of 42 references.
References · 31
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2020End-to-End Object Detection with Transformerscited by 7,384
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2020Deformable DETR: Deformable Transformers for End-to-End Object Detectioncited by 3,410
- 2015Learning both Weights and Connections for Efficient Neural Networkscited by 1,998
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2019Once-for-All: Train One Network and Specialize it for Efficient Deploymentcited by 778
- 2019Importance Estimation for Neural Network Pruningcited by 531
- 2019Rigging the Lottery: Making All Tickets Winnerscited by 491
19 more
- 2019Single Path One-Shot Neural Architecture Search with Uniform Samplingcited by 411
- 2017Scalable Training of Artificial Neural Networks with Adaptive Sparse Connectivity inspired by Network Sciencecited by 325
- 2022Optimal Brain Compression: A Framework for Accurate Post-Training Quantization and Pruningcited by 317
- 2021Post-Training Quantization for Vision Transformercited by 274
- 2021Accelerating Sparse Deep Neural Networkscited by 213
- 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
- 2021PTQ4ViT: Post-training quantization for vision transformers with twin uniform quantizationcited by 173
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 165
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2022MiniViT: Compressing Vision Transformers with Weight Multiplexingcited by 88
- 2019Single-Path NAS: Designing Hardware-Efficient ConvNets in less than 4 Hourscited by 87
- 2022Unified Visual Transformer Compressioncited by 79
- 2022Learning Best Combination for Efficient N:M Sparsitycited by 32
- 2022An Algorithm-Hardware Co-Optimized Framework for Accelerating N:M Sparse Transformerscited by 28
- 2023STEP: Learning N:M Structured Sparsity Masks from Scratch with Preconditioncited by 25
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
- 2021S2TA: Exploiting Structured Sparsity for Energy-Efficient Mobile CNN Accelerationcited by 19
- 2023VEGETA: Vertically-Integrated Extensions for Sparse/Dense GEMM Tile Acceleration on CPUscited by 8
Built on by
Citing papers per year: 2025: 2.
2 papers.