Skip to content

Calibrate Before Reason: Robust Visual Token Reduction against Semantic Drift in VLMs

Jul 2026 · arXiv.org · Vol abs/2607.27700 · 0 citations · 29 references
Computer Science

TL;DR

CaRe is proposed, a training-free robust framework that calibrates compact visual representations before reasoning to preserve semantic fidelity in VLMs and outperforms state-of-the-art token reduction baselines.

Abstract

Large Vision-Language Models (VLMs) suffer from prohibitive inference overhead due to long sequences of visual tokens. However, existing visual token reduction methods mainly improve efficiency by pruning or compressing redundant tokens without examining whether the resulting representation remains semantically consistent with the original representation. Mapping the original N-token visual sequence to K tokens may discard, dilute, or misassign critical visual cues, triggering severe semantic drift that deviates the VLM's understanding. In this paper, we first introduce the principle of'Calibrate Before Reason'to visual token reduction and propose CaRe, a training-free robust framework that calibrates compact visual representations before reasoning to preserve semantic fidelity in VLMs. CaRe consists of two mutually complementary modules: 1) Perturbation-Robust Calibration Anchoring, which identifies calibration anchors with stable model-side influence under multi-directional perturbations; 2) Confidence-Gated Token Calibration, which extracts reliable calibration signals from unselected tokens and injects them into anchors. Extensive evaluations across diverse VLM architectures and benchmarks verify that CaRe outperforms state-of-the-art token reduction baselines. While pruning 94.4% of visual tokens, our method retains 96.4% of the original full-token performance, delivering up to 2.30 times faster end-to-end inference speed relative to unpruned vanilla models.

View source

Similar papers

Jul 2026

Attention-Free and Lightweight Token Reduction for Efficient Vision-Language Models

An attention-free and lightweight token reduction framework as a plug-and-play module for VLMs, which preserves both important and diverse tokens to produce a compact visual representation, and achieves a favorable accuracy-efficiency trade-off.

Xuanyi Hao, Zuoyuan Zhang, Zhibo Wang et al. · 0 citations
#artificial intelligence Preprint Aug 2026

From Inference to Adaptation: A Unified Optimal Transport View of Vision Language Model

This work proposes a principled VLM TTA method called \algname, and theoretically reveals that the InfoNCE loss can be neatly reformulated as a Wasserstein OT formulation, thereby unifying the objectives of the inference and adaptation of VLMs to achieve their mutual benefits.

Qi Yu, Zhichen Zeng, Katherine Tieu et al. · 0 citations
Preprint Aug 2026

Not All Visual Tokens Are Equally Safe to Remove:Consequence-Sensitive Visual Token Compression

Visual token compression for vision--language models (VLMs) has largely relied on criteria such as attention, redundancy, and uncertainty to maximize average accuracy under a fixed compute budget, implicitly assuming that all errors carry equal cost. However, the consequence of an incorrect prediction on downstream tas...

Jing Wen, Liang He, Mingyu Cao et al. · 0 citations
Preprint Aug 2026

Mitigating Visual Degradation in MLLMs via Spatial-Spectral Visual Anchor Learning

The core of SSVAL is Visual Anchor Prompt Injection (VAPI), which introduces prompts that absorb rich knowledge from external VFMs during training, enabling them to serve as stable visual anchors that mitigate representation deviation during inference.

Qian-Long Yang, Bowen Ye, Xianda Guo et al. · 0 citations
#computer vision Preprint Aug 2026

PACE: A Unified Condense-and-Extract Paradigm for Fast VLM Inference

PACE (Pixel-Adaptive Condense and Extract), a training-free inference framework that accelerates both the vision encoder and the Large Language Model (LLM) via a unified Condense-and-Extract paradigm, is proposed.

Jun-Jie Liu, Shengyuan Ye, Xu Chen · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.