paper-with-me

Papers

Learning to Merge Tokens via Decoupled Embedding for Efficient Vision Transformers

2024-12-13 · Dong Hoon Lee, Seunghoon Hong

Recent token reduction methods for Vision Transformers (ViTs) incorporate token merging, which measures the similarities between token embeddings and combines the most similar pairs. However, their merging policies are directly dependent on intermediate features in ViTs, which prevents exploiting features tailored for merging and requires end-to-end training to improve token merging. In this paper, we propose Decoupled Token Embedding for Merging (DTEM) that enhances token merging through a decoupled embedding learned via a continuously relaxed token merging process. Our method introduces a lightweight embedding module decoupled from the ViT forward pass to extract dedicated features for token merging, thereby addressing the restriction from using intermediate features. The continuously relaxed token merging, applied during training, enables us to learn the decoupled embeddings in a differentiable manner. Thanks to the decoupled structure, our method can be seamlessly integrated into existing ViT backbones and trained either modularly by learning only the decoupled embeddings or end-to-end by fine-tuning. We demonstrate the applicability of DTEM on various tasks, including classification, captioning, and segmentation, with consistent improvement in token merging. Especially in the ImageNet-1k classification, DTEM achieves a 37.2% reduction in FLOPs while maintaining a top-1 accuracy of 79.85% with DeiT-small. Code is available at \href{https://github.com/movinghoon/dtem}{link}.

📄 PDF Abstract BibTeX arXiv:2412.10569

Code (1)

movinghoon/dtem 공식 구현 pytorch

Tasks

Token Reduction

Similar Papers 제목 키워드 기반

Decoupled Similarity for Task-Aware Token Pruning in Large Vision-Language Models

2026-04-13 · Kexin Ma, Jing Xiao, Chaofeng Chen, Geyong Min 외 arxiv

Token pruning has emerged as an effective approach to reduce the substantial computational overhead of Large Vision-Language Models (LVLMs) by discarding less informative visual tokens while preserving performance. Howev…

Learning to Merge Tokens in Vision Transformers

2022-02-24 · Cedric Renggli, André Susano Pinto, Neil Houlsby, Basil Mustafa 외

Transformers are widely applied to solve natural language understanding and computer vision tasks. While scaling up these architectures leads to improved performance, it often comes at the expense of much higher computat…

Natural Language Understanding

A Simple and Effective Positional Encoding for Transformers

2021-04-18 · EMNLP 2021 11 · Pu-Chin Chen, Henry Tsai, Srinadh Bhojanapalli, Hyung Won Chung 외

Transformer models are permutation equivariant. To supply the order and type information of the input tokens, position and segment embeddings are usually added to the input. Recent works proposed variations of positional…

Position

ALGM: Adaptive Local-then-Global Token Merging for Efficient Semantic Segmentation with Plain Vision Transformers

2024-06-14 · CVPR 2024 1 · Narges Norouzi, Svetlana Orlova, Daan de Geus, Gijs Dubbelman

This work presents Adaptive Local-then-Global Merging (ALGM), a token reduction method for semantic segmentation networks that use plain Vision Transformers. ALGM merges tokens in two stages: (1) In the first network lay…

SegmentationSemantic SegmentationToken Reduction

Artifacts and Attention Sinks: Structured Approximations for Efficient Vision Transformers

2025-07-21 · Andrew Lu, Wentinn Liao, Liuhui Wang, Huzheng Yang 외 arxiv

Vision transformers have emerged as a powerful tool across a wide range of applications, yet their inner workings remain only partially understood. In this work, we examine the phenomenon of massive tokens - tokens with …

Visual Question Answering