ToaSt: Token Channel Selection and Structured Pruning for Efficient ViT
Not on the map. Why?
Abstract (arXiv)
Vision Transformers (ViTs) have achieved remarkable success across various vision tasks, yet their deployment is often hindered by prohibitive computational costs. While structured weight pruning and token compression have emerged as promising solutions, they suffer from prolonged retraining and inter-layer dependencies that complicate optimization, respectively. We propose ToaSt, a decoupled framework applying specialized strategies to distinct ViT components. We apply coupled head-wise structured pruning to Multi-Head Self-Attention modules, leveraging attention operation characteristics to enhance robustness. For Feed-Forward Networks (over 60% of FLOPs), we introduce Token Channel Selection (TCS), a training-free method that filters redundant noise channels at inference time. Extensive evaluations across nine diverse models, including DeiT, ViT-MAE, and Swin Transformer, demonstrate that ToaSt achieves superior trade-offs between accuracy and efficiency, consistently outperforming existing baselines. On ViT-MAE-Huge, ToaSt achieves 88.52% accuracy (+1.64%p) with 39.4% FLOPs reduction. ToaSt also transfers effectively to diverse downstream tasks (COCO detection, ADE20K segmentation, CIFAR-100 classification), achieving 52.2 versus 51.9 mAP on COCO. Code: github.com/SHANNonLab-HUFS/ToaSt
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 40 of its 52 references that are in the map. First posted on arXiv 17 Feb 2026.
Builds on
40 of 52 references.
References · 40
- 2017Attention Is All You Needcited by 59,932
- 2021Learning Transferable Visual Models From Natural Language Supervisioncited by 33,456
- 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
- 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
- 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
- 2020Training data-efficient image transformers & distillation through attentioncited by 4,560
- 2022BLIP: Bootstrapping Language-Image Pre-training for Unified Vision-Language Understanding and Generationcited by 4,310
- 2022Token Merging: Your ViT But Fastercited by 995
- 2021Scaling Vision Transformerscited by 993
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 849
28 more
- 2024SnapKV: LLM Knows What You are Looking for Before Generationcited by 848
- 2023H2O: Heavy-Hitter Oracle for Efficient Generative Inference of Large Language Modelscited by 805
- 2023Scaling Vision Transformers to 22 Billion Parameterscited by 690
- 2024An Image is Worth 1/2 Tokens After Layer 2: Plug-and-Play Inference Acceleration for Large Vision-Language Modelscited by 629
- 2019Cascade R-CNN: High Quality Object Detection and Instance Segmentationcited by 428
- 2024LLaVA-PruMerge: Adaptive Token Reduction for Efficient Large Multimodal Modelscited by 394
- 2018Filter Pruning via Geometric Median for Deep Convolutional Neural Networks Accelerationcited by 365
- 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 359
- 2024QuIP#: Even Better LLM Quantization with Hadamard Incoherence and Lattice Codebookscited by 354
- 2024The Era of 1-bit LLMs: All Large Language Models are in 1.58 Bitscited by 289
- 2023DepGraph: Towards Any Structural Pruningcited by 202
- 2021Chasing Sparsity in Vision Transformers: An End-to-End Explorationcited by 181
- 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformercited by 175
- 2021PTQ4ViT: Post-training quantization for vision transformers with twin uniform quantizationcited by 173
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruningcited by 165
- 2022The Lazy Neuron Phenomenon: On Emergence of Activation Sparsity in Transformerscited by 121
- 2022LUT-GEMM: Quantized Matrix Multiplication based on LUTs for Efficient Inference in Large-Scale Generative Language Modelscited by 98
- 2023Joint Token Pruning and Squeezing Towards More Aggressive Compression of Vision Transformerscited by 79
- 2023DiffRate : Differentiable Compression Rate for Efficient Vision Transformerscited by 78
- 2022Vision Transformer Slimming: Multi-Dimension Searching in Continuous Optimization Spacecited by 66
- 2023Zero-TPrune: Zero-Shot Token Pruning through Leveraging of the Attention Graph in Pre-Trained Transformerscited by 61
- 2022HeatViT: Hardware-Efficient Adaptive Token Pruning for Vision Transformerscited by 46
- 2024Accelerating Transformers with Spectrum-Preserving Token Mergingcited by 35
- 2023Making Vision Transformers Efficient from A Token Sparsification Viewcited by 28
- 2024Isomorphic Pruning for Vision Modelscited by 21
- 2023CAIT: Triple-Win Compression towards High Accuracy, Fast Inference, and Favorable Transferability For ViTscited by 9
- 2025FIGLUT: An Energy-Efficient Accelerator Design for FP-INT GEMM Using Look-Up Tablescited by 8
- 2024REPrune: Channel Pruning via Kernel Representative Selectioncited by 4
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025HEART-VIT: Hessian-Guided Efficient Dynamic Attention and Token Pruning in Vision Transformer
- 2023PPT: Token Pruning and Pooling for Efficient Vision Transformers
- 2025Similarity-Aware Token Pruning: Your VLM but Faster
- 2022Adaptive Sparse ViT: Towards Learnable Adaptive Token Pruning by Fully Exploiting Self-Attention
- 2026ASAP: Attention Sink Anchored Pruning
- 2023No Token Left Behind: Efficient Vision Transformer via Dynamic Token Idling
- 2026ViT-5: Vision Transformers for The Mid-2020s
- 2025Token Compression Meets Compact Vision Transformers: A Survey and Comparative Evaluation for Edge AI