arXiv:2608.26142cs.CLcs.AI2026-08中稿 · ICML

仅靠位置信息就能实现高效图像指代分割的令牌压缩。

Position Is All You Need: A Free Lunch Token Compression Strategy for MLLM-based Referring Expression Segmentation

论文配图:Position Is All You Need: A Free Lunch Token Compression Strategy for MLLM-based Referring Expression Segmentation
图 1 · 摘自论文原文
  • 基于视觉令牌位置信息设计压缩策略,无需训练。
  • 在多个基准上优于现有方法,性能提升显著。
  • 适合需要降低计算开销的多模态大模型应用者。

指代表达分割(RES)旨在从复杂隐含的文本查询中生成像素级分割掩码。尽管多模态大语言模型(MLLMs)显著提升了RES性能,但其高昂的计算开销仍是关键瓶颈,却极少被研究。我们首先评估了典型令牌压缩方法在此任务上的表现,发现性能意外下降。通过大量实验,我们发现RES的令牌压缩需保留原始位置嵌入和局部空间结构,表明视觉令牌的位置信息比其他任务更为关键。由此提出全新思路:能否仅依赖位置信息设计压缩方法?为此,我们提出PAYN——一种即插即用、无需训练的压缩方法,仅依据位置信息保留每个局部邻域中分布合理的令牌,并严格保持原始位置索引,从而维持空间关系一致性。在多个RES基准上的实验证明,该方法优于现有压缩方法,验证了‘位置即一切’的有效性。代码已开源。

原文摘要 · Abstract (English)

Referring Expression Segmentation (RES) aims to generate pixel-wise segmentation masks from complex and implicit textual queries. While recent advances in Multimodal Large Language Models (MLLMs) have substantially boosted RES performance, their prohibitive computational overhead remains a critical bottleneck, which, however, is rarely explored. To fill this gap, we first evaluate typical token compression methods on this task and observe a surprising performance degradation. In this paper, we aim to understand this phenomenon for a solution. By extensive experiments, we find that token compression for RES requires preserving the original position embeddings and local neighboring spatial structures, indicating that visual token position information is far more critical than in other tasks. Building on this insight, we ask: Can we design the token compression method purely based on the position information? Therefore, we propose PAYN, a plug-and-play, training-free token compression method that relies solely on position information. PAYN retains tokens that are adequately distributed in every local neighboring region while strictly preserving original positional indices, thereby maintaining spatial relational consistency. Experiments on multiple RES benchmarks demonstrate that our method outperforms existing token compression methods, verifying that position is indeed all you need for token compression in the MLLM-based RES task. Codes are avaliable at https://github.com/YuhanLiu231/PAYN.

图像分割令牌压缩多模态模型

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。