arXiv:2604.11095cs.LGcs.AI2026-04被引 1

用可学习的瓶颈令牌提升多模态检索的语义压缩效率

Bottleneck Tokens for Unified Multimodal Retrieval

论文配图:Bottleneck Tokens for Unified Multimodal Retrieval
图 1 · 摘自论文原文
  • 引入可学习的瓶颈令牌,显式聚合多模态序列信息
  • 在MMEB-V2上达到59.0的综合得分,视频问答提升12.6
  • 适合需要高效多模态检索的模型开发者

将仅解码器的多模态大语言模型用于统一多模态检索面临两个结构缺陷:其一,现有方法依赖隐式池化,将标准词汇标记(如<EOS>)的隐藏状态作为序列级表示,而该机制并非为信息聚合设计;其二,对比微调仅指定嵌入应匹配的目标,未提供信息压缩到该嵌入的逐令牌指导。本文通过两个互补组件解决上述问题:架构上引入瓶颈令牌(BToks),一组可学习的固定容量令牌,作为显式池化机制;训练时提出生成式信息浓缩:结合下一词预测目标与浓缩掩码,切断目标令牌与查询令牌的直接注意力路径,强制所有预测信号经由BToks,使生成损失转化为密集的、逐令牌的语义压缩监督。推理时仅需输入与BToks单次前向传播,开销接近常规最后令牌池化。在包含78个数据集、3种模态、9个元任务的MMEB-V2基准上,本方法在20亿参数量级中达最优,综合得分为59.0(较VLM2Vec-V2提升3.6),在语义挑战任务上显著增益(如视频问答+12.6)。

原文摘要 · Abstract (English)

Adapting decoder-only multimodal large language models (MLLMs) for unified multimodal retrieval faces two structural gaps. First, existing methods rely on implicit pooling, which overloads the hidden state of a standard vocabulary token (e.g., <EOS>) as the sequence-level representation, a mechanism never designed for information aggregation. Second, contrastive fine-tuning specifies what the embedding should match but provides no token-level guidance on how information should be compressed into it. We address both gaps with two complementary components. Architecturally, we introduce Bottleneck Tokens (BToks), a small set of learnable tokens that serve as a fixed-capacity explicit pooling mechanism. For training, we propose Generative Information Condensation: a next-token prediction objective coupled with a Condensation Mask that severs the direct attention path from target tokens to query tokens. All predictive signals are thereby forced through the BToks, converting the generative loss into dense, token-level supervision for semantic compression. At inference time, only the input and BToks are processed in a single forward pass with negligible overhead over conventional last-token pooling. On MMEB-V2 (78 datasets, 3 modalities, 9 meta-tasks), our approach achieves state-of-the-art among 2B-scale methods under comparable data conditions, attaining an Overall score of 59.0 (+3.6 over VLM2Vec-V2) with substantial gains on semantically demanding tasks (e.g., +12.6 on Video-QA).

多模态检索瓶颈令牌信息压缩LLM

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