Multi-Dimensional Model Compression of Vision Transformer
Not on the map. Why?
Abstract (arXiv)
Vision transformers (ViT) have recently attracted considerable attentions, but the huge computational cost remains an issue for practical deployment. Previous ViT pruning methods tend to prune the model along one dimension solely, which may suffer from excessive reduction and lead to sub-optimal model quality. In contrast, we advocate a multi-dimensional ViT compression paradigm, and propose to harness the redundancy reduction from attention head, neuron and sequence dimensions jointly. We firstly propose a statistical dependence based pruning criterion that is generalizable to different dimensions for identifying deleterious components. Moreover, we cast the multi-dimensional compression as an optimization, learning the optimal pruning policy across the three dimensions that maximizes the compressed model's accuracy under a computational budget. The problem is solved by our adapted Gaussian process search with expected improvement. Experimental results show that our method effectively reduces the computational cost of various ViT models. For example, our method reduces 40% FLOPs without top-1 accuracy loss for DeiT and T2T-ViT models, outperforming previous state-of-the-arts.
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 25 of its 37 references that are in the map. First posted on arXiv 31 Dec 2021.
Builds on
25 of 37 references.
References · 25
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 2014Microsoft COCO: Common Objects in Contextcited by 17,498
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2021Pyramid Vision Transformer: A Versatile Backbone for Dense Prediction without Convolutionscited by 1,960
- 2019Generating Long Sequences with Sparse Transformerscited by 1,523
- 2020Linformer: Self-Attention with Linear Complexitycited by 1,462
- 2021Tokens-to-Token ViT: Training Vision Transformers from Scratch on ImageNetcited by 1,096
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
- 2016Learning Structured Sparsity in Deep Neural Networkscited by 538
- 2021Nystr"omformer: A Nystr"om-Based Algorithm for Approximating Self-Attentioncited by 468
- 2019Single Path One-Shot Neural Architecture Search with Uniform Samplingcited by 411
- 2021Post-Training Quantization for Vision Transformercited by 274
13 more
- 2019Random Search and Reproducibility for Neural Architecture Searchcited by 253
- 2020SpAtten: Efficient Sparse Attention Architecture with Cascade Token and Head Pruningcited by 228
- 2017Data-Driven Sparse Structure Selection for Deep Neural Networkscited by 181
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformercited by 175
- 2019Towards Optimal Structured CNN Pruning via Generative Adversarial Learningcited by 145
- 2021Patch Slimming for Efficient Vision Transformerscited by 131
- 2021IA-RED2: Interpretability-Aware Redundancy Reduction for Vision Transformerscited by 127
- 2021Vision Transformer Pruningcited by 77
- 2021Learning Efficient Vision Transformers via Fine-Grained Manifold Distillationcited by 60
- 2021A Unified Pruning Framework for Vision Transformerscited by 40
- 2020Accelerate CNNs from Three Dimensions: A Comprehensive Pruning Frameworkcited by 27
- 2021Pruning Self-attentions into Convolutional Layers in Single Pathcited by 24
Built on by
Citing papers per year: 2022: 5; 2023: 2; 2024: 4; 2025: 1; 2026: 1.
13 papers.
Sort:
By area:
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2024SHViT: Single-Head Vision Transformer with Memory Efficient Macro Designcited by 55
- 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
- 2022Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuningcited by 33
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
- 2023CAIT: Triple-Win Compression towards High Accuracy, Fast Inference, and Favorable Transferability For ViTscited by 9
- 2022Data Level Lottery Ticket Hypothesis for Vision Transformerscited by 7
- 2022Vision Transformer Compression with Structured Pruning and Low Rank Approximationcited by 4
- 2024Understanding Neural Network Binarization with Forward and Backward Proximal Quantizerscited by 4
- 2025Merging Smarter, Generalizing Better: Enhancing Model Merging on OOD Datacited by 3
- 2024A Comprehensive Study of Structural Pruning for Vision Modelscited by 0
- 2024Exploring The Neural Burden In Pruned Models: An Insight Inspired By Neurosciencecited by 0
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compression28 Mar 2026
- 2025Merging Smarter, Generalizing Better: Enhancing Model Merging on OOD Data10 Jun 2025
- 2024Exploring The Neural Burden In Pruned Models: An Insight Inspired By Neuroscience23 Jul 2024
- 2024A Comprehensive Study of Structural Pruning for Vision Models18 Jun 2024
- 2024Understanding Neural Network Binarization with Forward and Backward Proximal Quantizers27 Feb 2024
- 2024SHViT: Single-Head Vision Transformer with Memory Efficient Macro Design29 Jan 2024
- 2023CAIT: Triple-Win Compression towards High Accuracy, Fast Inference, and Favorable Transferability For ViTs27 Sep 2023
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations13 Aug 2023
- 2022Data Level Lottery Ticket Hypothesis for Vision Transformers2 Nov 2022
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models14 Oct 2022
- 2022Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuning3 Oct 2022
- 2022CHEX: CHannel EXploration for CNN Model Compression29 Mar 2022
1 more
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendationscited by 200
- 2024SHViT: Single-Head Vision Transformer with Memory Efficient Macro Designcited by 55
- 2022CHEX: CHannel EXploration for CNN Model Compressioncited by 36
- 2022Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuningcited by 33
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Modelscited by 20
- 2022Data Level Lottery Ticket Hypothesis for Vision Transformerscited by 7
- 2022Vision Transformer Compression with Structured Pruning and Low Rank Approximationcited by 4
- 2024Understanding Neural Network Binarization with Forward and Backward Proximal Quantizerscited by 4
- 2025Merging Smarter, Generalizing Better: Enhancing Model Merging on OOD Datacited by 3
- 2024A Comprehensive Study of Structural Pruning for Vision Modelscited by 0
- 2024Exploring The Neural Burden In Pruned Models: An Insight Inspired By Neurosciencecited by 0
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compressioncited by 0
- 2026Decompose, Mix, Adapt: A Unified Framework for Parameter-Efficient Neural Network Recombination and Compression28 Mar 2026
- 2025Merging Smarter, Generalizing Better: Enhancing Model Merging on OOD Data10 Jun 2025
- 2024Exploring The Neural Burden In Pruned Models: An Insight Inspired By Neuroscience23 Jul 2024
- 2024A Comprehensive Study of Structural Pruning for Vision Models18 Jun 2024
- 2024Understanding Neural Network Binarization with Forward and Backward Proximal Quantizers27 Feb 2024
- 2024SHViT: Single-Head Vision Transformer with Memory Efficient Macro Design29 Jan 2024
- 2023A Survey on Deep Neural Network Pruning-Taxonomy, Comparison, Analysis, and Recommendations13 Aug 2023
- 2022Data Level Lottery Ticket Hypothesis for Vision Transformers2 Nov 2022
- 2022CAP: Correlation-Aware Pruning for Highly-Accurate Sparse Vision Models14 Oct 2022
- 2022Expediting Large-Scale Vision Transformer for Dense Prediction without Fine-tuning3 Oct 2022
- 2022CHEX: CHannel EXploration for CNN Model Compression29 Mar 2022
- 2022Vision Transformer Compression with Structured Pruning and Low Rank Approximation25 Mar 2022