BindCLIP: One Balanced Coupling For Compositional Vision Language Scoring

📅 2026-09-20
📈 Citations: 0
✨ Influential: 0
📄 PDF
🤖 AI Summary
为了解决视觉-语言模型偏好组合不正确描述的问题,BindCLIP通过一个平衡的token-patch-depth最优传输耦合方法来评分。
📝 Abstract
Global vision--language similarities compress an image and a caption into one vector, preserving semantics but not which word corresponds to which region or how those regions are arranged; a model can recognize every word and object yet prefer a compositionally incorrect caption. We argue that a frozen encoder retains this association structure, so the problem is to read it rather than to rebuild it beside the pretrained similarity. We introduce BindCLIP, a pairwise scorer built on one latent object: a balanced token--patch--depth optimal-transport coupling that places both candidate captions and several visual depths in a single plan. Semantic, entity, order, and spatial evidence are read as energies of this state, and exchanging the candidates permutes the plan, making the score exactly antisymmetric. A geometric refinement inside the coupling contracts moves that the candidates and the visual depths do not support. No task label, parser, relation inventory, or detector is used. One checkpoint and one inference path improve the official What'sUp, ARO, and SugarCrepe benchmarks over frozen global CLIP, with the strongest transfer on the relation splits. Controls rule out patch access and caption-length shortcuts, and an inference-time lesion localizes spatial arrangement to the coupling.
Problem

Research questions and friction points this paper is trying to address.

vision-language
compositional
semantics
caption
object
Innovation

Methods, ideas, or system contributions that make the work stand out.

balanced token-patch-depth optimal-transport coupling
antisymmetric score
geometric refinement
🔎 Similar Papers
No similar papers found.
💼 Related Jobs
No related jobs found.
L
Liuyang Song
Peking University
Y
Yi Zhang
Dongguan University of Technology
Z
Zhongyi Deng
Sichuan Agricultural University
D
Daqian Yang
Peking University
H
Hongbo Zhang
Peking University