Saved in:
Bibliographic Details
Main Authors: Su, Wei-Yuan, Zhang, Ruijie, Zhang, Zheng
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2603.27900
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910084183883776
author Su, Wei-Yuan
Zhang, Ruijie
Zhang, Zheng
author_facet Su, Wei-Yuan
Zhang, Ruijie
Zhang, Zheng
contents Vision Transformers (ViTs) achieve state-of-the-art performance but suffer from the $O(N^2)$ complexity of self-attention, making inference costly for high-resolution inputs. To address this bottleneck, token pruning has emerged as a critical technique to accelerate inference. Most existing methods rely on the [CLS] token to estimate patch importance. However, we argue that the [CLS] token can be unreliable in early layers where semantic representations are still immature. As a result, pruning in the early layer often leads to inaccurate importance estimation and unnecessary information loss. In this work, we propose a training-free token importance metric, namely Col-Ln, which is derived from Rényi entropy that enables the identification of informative tokens from the first layer of the network, thereby enabling more reliable pruning in token reduction. Extensive experiments on ViTs and Large Vision-Language Models (LVLMs) demonstrate that our approach consistently outperforms state-of-the-art pruning methods across diverse benchmarks.
format Preprint
id arxiv_https___arxiv_org_abs_2603_27900
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Rényi Entropy: A New Token Pruning Metric for Vision Transformers
Su, Wei-Yuan
Zhang, Ruijie
Zhang, Zheng
Computer Vision and Pattern Recognition
Vision Transformers (ViTs) achieve state-of-the-art performance but suffer from the $O(N^2)$ complexity of self-attention, making inference costly for high-resolution inputs. To address this bottleneck, token pruning has emerged as a critical technique to accelerate inference. Most existing methods rely on the [CLS] token to estimate patch importance. However, we argue that the [CLS] token can be unreliable in early layers where semantic representations are still immature. As a result, pruning in the early layer often leads to inaccurate importance estimation and unnecessary information loss. In this work, we propose a training-free token importance metric, namely Col-Ln, which is derived from Rényi entropy that enables the identification of informative tokens from the first layer of the network, thereby enabling more reliable pruning in token reduction. Extensive experiments on ViTs and Large Vision-Language Models (LVLMs) demonstrate that our approach consistently outperforms state-of-the-art pruning methods across diverse benchmarks.
title Rényi Entropy: A New Token Pruning Metric for Vision Transformers
topic Computer Vision and Pattern Recognition
url https://arxiv.org/abs/2603.27900