English
Related papers

Related papers: Learning to Merge Tokens via Decoupled Embedding f…

200 papers

Token merging has emerged as a new paradigm that can accelerate the inference of Vision Transformers (ViTs) without any retraining or fine-tuning. To push the frontier of training-free acceleration in ViTs, we improve token merging by…

Computer Vision and Pattern Recognition · Computer Science 2024-07-02 Jung Hwan Heo , Seyedarmin Azizi , Arash Fayyazi , Massoud Pedram

Although Vision Transformers (ViTs) have become the standard architecture in computer vision, their massive sizes lead to significant computational overhead. Token compression techniques have attracted considerable attention to address this…

Computer Vision and Pattern Recognition · Computer Science 2026-04-02 Jaeyeon Lee , Dong-Wan Choi

Self-attention and transformers have been widely used in deep learning. Recent efforts have been devoted to incorporating transformer blocks into different neural architectures, including those with convolutions, leading to various visual…

Computer Vision and Pattern Recognition · Computer Science 2025-07-22 Yancheng Wang , Yingzhen Yang

Vision transformers have been widely explored in various vision tasks. Due to heavy computational cost, much interest has aroused for compressing vision transformer dynamically in the aspect of tokens. Current methods mainly pay attention…

Computer Vision and Pattern Recognition · Computer Science 2025-06-09 Fanhu Zeng , Deli Yu , Zhenglun Kong , Hao Tang

Masked image modeling (MIM) has emerged as a promising approach for pre-training Vision Transformers (ViTs). MIMs predict masked tokens token-wise to recover target signals that are tokenized from images or generated by pre-trained models…

Computer Vision and Pattern Recognition · Computer Science 2025-03-24 Taekyung Kim , Byeongho Heo , Dongyoon Han

We present DyMU, an efficient, training-free framework that dynamically reduces the computational burden of vision-language models (VLMs) while maintaining high task performance. Our approach comprises two key components. First, Dynamic…

Computer Vision and Pattern Recognition · Computer Science 2025-05-13 Zhenhailong Wang , Senthil Purushwalkam , Caiming Xiong , Silvio Savarese , Heng Ji , Ran Xu

Vision transformers have achieved significant improvements on various vision tasks but their quadratic interactions between tokens significantly reduce computational efficiency. Many pruning methods have been proposed to remove redundant…

Computer Vision and Pattern Recognition · Computer Science 2022-11-22 Sifan Long , Zhen Zhao , Jimin Pi , Shengsheng Wang , Jingdong Wang

Vision transformers have demonstrated remarkable success in a wide range of computer vision tasks over the last years. However, their high computational costs remain a significant barrier to their practical deployment. In particular, the…

Computer Vision and Pattern Recognition · Computer Science 2023-08-21 Maxim Bonnaerens , Joni Dambre

Diffusion transformers have shown exceptional performance in visual generation but incur high computational costs. Token reduction techniques that compress models by sharing the denoising process among similar tokens have been introduced.…

Computer Vision and Pattern Recognition · Computer Science 2025-05-20 Haipeng Fang , Sheng Tang , Juan Cao , Enshuo Zhang , Fan Tang , Tong-Yee Lee

Many modern ViT backbones adopt spatial architectural designs, such as window attention, decomposed relative positional embeddings in SAM, and RoPE in DINOv3. Such architectures impose new challenges on token reduction, as the vast majority…

Computer Vision and Pattern Recognition · Computer Science 2026-03-03 Wenyi Gong , Mieszko Lis

Increasing the throughput of the Transformer architecture, a foundational component used in numerous state-of-the-art models for vision and language tasks (e.g., GPT, LLaVa), is an important problem in machine learning. One recent and…

We introduce Token Merging (ToMe), a simple method to increase the throughput of existing ViT models without needing to train. ToMe gradually combines similar tokens in a transformer using a general and light-weight matching algorithm that…

Computer Vision and Pattern Recognition · Computer Science 2023-03-03 Daniel Bolya , Cheng-Yang Fu , Xiaoliang Dai , Peizhao Zhang , Christoph Feichtenhofer , Judy Hoffman

The quadratic cost of self-attention in Vision Transformers (ViTs) constitutes a fundamental bottleneck for practical deployment, motivating a vibrant line of research on token reduction. Among existing approaches, token merging (ToMe) has…

Computer Vision and Pattern Recognition · Computer Science 2026-05-28 Semi Lee , Hyejin Go , Hyesong Choi

Vision Transformers (ViTs) achieve state-of-the-art performance in semantic segmentation but are hindered by high computational and memory costs. To address this, we propose STEP (SuperToken and Early-Pruning), a hybrid token-reduction…

Computer Vision and Pattern Recognition · Computer Science 2026-05-21 Michal Szczepanski , Martyna Poreba , Karim Haroun

As the scale of data and models for video understanding rapidly expand, handling long-form video input in transformer-based models presents a practical challenge. Rather than resorting to input sampling or token dropping, which may result…

Computer Vision and Pattern Recognition · Computer Science 2024-11-01 Seon-Ho Lee , Jue Wang , Zhikang Zhang , David Fan , Xinyu Li

Decreasing sequence length is a common way to accelerate transformers, but prior token reduction work often targets classification and reports proxy metrics rather than end-to-end latency. For semantic segmentation, token reduction is…

Computer Vision and Pattern Recognition · Computer Science 2026-04-08 Simon Ravé , Pejman Rasti , David Rousseau

Recent token merging techniques for Vision Transformers (ViTs) provide substantial speedups by reducing the number of tokens processed by self-attention, often without retraining. However, their direct application to the Segment Anything…

Token compression expedites the training and inference of Vision Transformers (ViTs) by reducing the number of the redundant tokens, e.g., pruning inattentive tokens or merging similar tokens. However, when applied to downstream tasks,…

Computer Vision and Pattern Recognition · Computer Science 2024-08-14 Shibo Jie , Yehui Tang , Jianyuan Guo , Zhi-Hong Deng , Kai Han , Yunhe Wang

Token compression is essential for reducing the computational and memory requirements of transformer models, enabling their deployment in resource-constrained environments. In this work, we propose an efficient and hardware-compatible token…

Computer Vision and Pattern Recognition · Computer Science 2025-04-01 Junzhu Mao , Yang Shen , Jinyang Guo , Yazhou Yao , Xiansheng Hua

Vision Transformer (ViT) has emerged as a prominent backbone for computer vision. For more efficient ViTs, recent works lessen the quadratic cost of the self-attention layer by pruning or fusing the redundant tokens. However, these works…

Computer Vision and Pattern Recognition · Computer Science 2024-04-02 Sanghyeok Lee , Joonmyung Choi , Hyunwoo J. Kim
‹ Prev 1 2 3 10 Next ›