Compressing Vision Transformers for Low-Resource Visual Learning
Not on the map. Why?
Abstract (arXiv)
Vision transformer (ViT) and its variants have swept through visual learning leaderboards and offer state-of-the-art accuracy in tasks such as image classification, object detection, and semantic segmentation by attending to different parts of the visual input and capturing long-range spatial dependencies. However, these models are large and computation-heavy. For instance, the recently proposed ViT-B model has 86M parameters making it impractical for deployment on resource-constrained devices. As a result, their deployment on mobile and edge scenarios is limited. In our work, we aim to take a step toward bringing vision transformers to the edge by utilizing popular model compression techniques such as distillation, pruning, and quantization. Our chosen application environment is an unmanned aerial vehicle (UAV) that is battery-powered and memory-constrained, carrying a single-board computer on the scale of an NVIDIA Jetson Nano with 4GB of RAM. On the other hand, the UAV requires high accuracy close to that of state-of-the-art ViTs to ensure safe object avoidance in autonomous navigation, or correct localization of humans in search-and-rescue. Inference latency should also be minimized given the application requirements. Hence, our target is to enable rapid inference of a vision transformer on an NVIDIA Jetson Nano (4GB) with minimal accuracy loss. This allows us to deploy ViTs on resource-constrained devices, opening up new possibilities in surveillance, environmental monitoring, etc. Our implementation is made available at https://github.com/chensy7/efficient-vit.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 31 references that are in the map. First posted on arXiv 5 Sep 2023.
Builds on
26 of 31 references.
References · 26
- 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
- 2015Distilling the Knowledge in a Neural Networkcited by 10,076
- 2017Rethinking Atrous Convolution for Semantic Image Segmentationcited by 2,154
- 2020Transformers are RNNs: Fast Autoregressive Transformers with Linear Attentioncited by 1,979
- 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
- 2018Unified Perceptual Parsing for Scene Understandingcited by 1,265
- 2019Are Sixteen Heads Really Better than One?cited by 803
- 2018SNIP: Single-shot Network Pruning based on Connection Sensitivitycited by 802
- 2021MobileViT: Light-weight, General-purpose, and Mobile-friendly Vision Transformercited by 636
- 2016DoReFa-Net: Training Low Bitwidth Convolutional Neural Networks with Low Bitwidth Gradientscited by 557
14 more
- 2017ThiNet: A Filter Level Pruning Method for Deep Neural Network Compressioncited by 438
- 2021Post-Training Quantization for Vision Transformercited by 274
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2022QuadTree Attention for Vision Transformerscited by 129
- 2021Scatterbrain: Unifying Sparse and Low-rank Attention Approximationcited by 128
- 2020Layer-adaptive sparsity for the Magnitude-based Pruningcited by 122
- 2022Unified Visual Transformer Compressioncited by 79
- 2020Parameter Efficient Multimodal Transformers for Video Representation Learningcited by 52
- 2022MixFormer: Mixing Features across Windows and Dimensionscited by 43
- 2020Real-time Semantic Segmentation with Fast Attentioncited by 36
- 2022ViTKD: Practical Guidelines for ViT feature knowledge distillationcited by 34
- 2022ViTALiTy: Unifying Low-rank and Sparse Approximation for Vision Transformer Acceleration with a Linear Taylor Attentioncited by 29
- 2022Vision Transformer Compression with Structured Pruning and Low Rank Approximationcited by 4
- 2022DBA: Efficient Transformer with Dynamic Bilinear Low-Rank Attentioncited by 3
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.