arXiv:2603.21232cs.CVcs.AI2026-03被引 2

用查询引导动态压缩视觉标记,提升多模态模型效率

QMoP: Query Guided Mixture-of-Projector for Efficient Visual Token Compression

  • 三路协同压缩:池化、重采样、剪枝,适配不同视觉信息
  • 查询引导路由动态加权,实现自适应融合,减少信息损失
  • 适用于需要高效视觉编码的多模态大模型部署场景

多模态大语言模型面临严重的计算与内存瓶颈,因视觉标记数量远超文本标记。现有方法虽使用投影模块对齐并压缩视觉标记,但通常依赖固定启发式策略,难以适应多样场景。本文提出查询引导混合投影器(QMoP),通过三个协作分支实现自适应压缩:(1) 池化分支提取粗粒度全局语义,(2) 重采样分支获取高层语义表示,(3) 剪枝分支精细选择关键视觉细节。为协调各分支,设计查询引导路由器(QGR),基于视觉输入与文本查询动态选择并加权输出。采用类似Mixture-of-Experts的融合机制,整合各策略优势并抑制噪声。为系统评估视觉标记压缩效果,构建了专用基准VTCBench,用于衡量压缩导致的信息损失。大量实验表明,尽管仅使用基础压缩模块,QMoP仍优于强基线,在内存、计算和推理时间上均有显著节省。

原文摘要 · Abstract (English)

Multimodal large language models suffer from severe computational and memory bottlenecks, as the number of visual tokens far exceeds that of textual tokens. While recent methods employ projector modules to align and compress visual tokens into text-aligned features, they typically depend on fixed heuristics that limit adaptability across diverse scenarios. In this paper, we first propose Query Guided Mixture-of-Projector (QMoP), a novel and flexible framework that adaptively compresses visual tokens via three collaborative branches: (1) a pooling-based branch for coarse-grained global semantics, (2) a resampler branch for extracting high-level semantic representations, and (3) a pruning-based branch for fine-grained token selection to preserve critical visual detail. To adaptively coordinate these branches, we introduce the Query Guided Router (QGR), which dynamically selects and weights the outputs from different branches based on both visual input and textual queries. A Mixture-of-Experts-style fusion mechanism is designed to aggregate the outputs, harnessing the strengths of each strategy while suppressing noise. To systematically evaluate the effects of Visual Token Compression, we also develop VTCBench, a dedicated benchmark for evaluating the information loss induced by visual token compression. Extensive experiments demonstrate that despite relying on fundamental compression modules, QMoP outperforms strong baselines and delivers significant savings in memory, computation, and inference time.

视觉压缩多模态高效推理混合专家

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