paper-with-me

홈 › Papers

Token Compression Meets Compact Vision Transformers: A Survey and Comparative Evaluation for Edge AI

2025-07-13 · Phat Nguyen, Ngai-Man Cheung

Token compression techniques have recently emerged as powerful tools for accelerating Vision Transformer (ViT) inference in computer vision. Due to the quadratic computational complexity with respect to the token sequence length, these methods aim to remove less informative tokens before the attention layers to improve inference throughput. While numerous studies have explored various accuracy-efficiency trade-offs on large-scale ViTs, two critical gaps remain. First, there is a lack of unified survey that systematically categorizes and compares token compression approaches based on their core strategies (e.g., pruning, merging, or hybrid) and deployment settings (e.g., fine-tuning vs. plug-in). Second, most benchmarks are limited to standard ViT models (e.g., ViT-B, ViT-L), leaving open the question of whether such methods remain effective when applied to structurally compressed transformers, which are increasingly deployed on resource-constrained edge devices. To address these gaps, we present the first systematic taxonomy and comparative study of token compression methods, and we evaluate representative techniques on both standard and compact ViT architectures. Our experiments reveal that while token compression methods are effective for general-purpose ViTs, they often underperform when directly applied to compact designs. These findings not only provide practical insights but also pave the way for future research on adapting token optimization techniques to compact transformer-based networks for edge AI and AI agent applications.

📄 PDF Abstract BibTeX arXiv:2507.09702

Code (0)

등록된 구현이 없습니다.

Tasks

AI Agent

Methods 이 논문이 사용한 방법론

Dropout Dropout is a regularization technique for neural networks that drops a unit (along with connections) at training time with a specified probability $p$ (a common value is…
Vision Transformer The Vision Transformer, or ViT, is a model for image classification that employs a Transformer-like architecture over…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Dense Connections Dense Connections, or Fully Connected Connections, are a type of layer in a deep neural network that use a linear operation where every input is connected to every output…
Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…

Similar Papers 제목 키워드 기반

Representative Attention For Vision Transformers

2026-05-14 · Yuntong Li, Hainuo Wang, Hengxing Liu, Mingjia Li 외 arxiv

Linear attention has emerged as a promising direction for scaling Vision Transformers beyond the quadratic cost of dense self-attention. A prevalent strategy is to compress spatial tokens into a compact set of intermedia…

Semantic SegmentationImage ClassificationObject Detection

Planning-aligned Token Compression for Long-Context Autonomous Driving

2026-06-05 · Zhixuan Liang, Yuxiao Chen, Yurong You, Peter Karkus 외 arxiv

Monolithic vision-action models represent an emerging paradigm in autonomous driving. However, this architecture produces token sequences that quickly exceed real-time computational budgets when encoding extended tempora…

Autonomous Driving

Next-Latent Prediction Transformers Learn Compact World Models

2025-11-08 · Jayden Teoh, Manan Tomar, Kwangjun Ahn, Edward S. Hu 외 arxiv

Transformers replace recurrence with a memory that grows with sequence length and self-attention that enables ad-hoc lookups over past tokens. Consequently, they lack an inherent incentive to compress history into compac…

Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer

2021-08-03 · Yifan Xu, Zhijie Zhang, Mengdan Zhang, Kekai Sheng 외

Vision transformers (ViTs) have recently received explosive popularity, but the huge computational cost is still a severe issue. Since the computation complexity of ViT is quadratic with respect to the input sequence len…

Efficient ViTsimage-classificationImage Classification

DiffRate : Differentiable Compression Rate for Efficient Vision Transformers

2023-05-29 · ICCV 2023 1 · Mengzhao Chen, Wenqi Shao, Peng Xu, Mingbao Lin 외

Token compression aims to speed up large-scale vision transformers (e.g. ViTs) by pruning (dropping) or merging tokens. It is an important but challenging task. Although recent advanced approaches achieved great success,…

Efficient ViTs