UniRank无需转换模态,端到端优化图文混合候选排序。
UniRank: End-to-End Domain-Specific Reranking of Hybrid Text-Image Candidates

- 直接对图文混合候选进行统一打分,避免模态转换开销。
- 在文献检索和专利搜索中,Recall@1分别提升8.9%和7.3%。
- 适合需要精准跨模态排序的领域专用场景。
重排序是信息检索系统的关键环节。尽管文本单模态重排序已取得显著进展,但包含混合文本与图像候选项的多模态重排序仍具挑战性,主要源于模态差距:文本重排序器天然更接近文本候选,导致跨模态排序偏差且效果不佳。视觉-语言模型(VLMs)通过强跨模态对齐缓解此问题,近年被用于构建多模态重排序器。然而,多数基于VLM的重排序器将所有候选编码为图像,将文本转为图像会带来巨大计算开销。同时,现有开源多模态重排序器通常在通用数据上训练,领域特定场景下表现不佳。为此,我们提出UniRank,一种原生支持图文混合候选评分与排序的VLM基重排序框架。基于该混合评分接口,UniRank提供端到端领域适应流程,包含:(1) 指令微调阶段,通过将标签词概率映射为统一标量得分,学习校准的跨模态相关性评分;(2) 基于难负样本的偏好对齐阶段,构建领域内成对偏好,并通过人类反馈强化学习(RLHF)进行查询级策略优化。在科学文献检索与设计专利搜索上的大量实验表明,UniRank持续优于当前最优基线,分别实现Recall@1提升8.9%与7.3%。
原文摘要 · Abstract (English)
Reranking is a critical component in many information retrieval pipelines. Despite remarkable progress in text-only settings, multimodal reranking remains challenging, particularly when the candidate set contains hybrid text and image items. A key difficulty is the modality gap: a text reranker is intrinsically closer to text candidates than to image candidates, leading to biased and suboptimal cross-modal ranking. Vision-language models (VLMs) mitigate this gap through strong cross-modal alignment and have recently been adopted to build multimodal rerankers. However, most VLM-based rerankers encode all candidates as images, and treating text as images introduces substantial computational overhead. Meanwhile, existing open-source multimodal rerankers are typically trained on general-domain data and often underperform in domain-specific scenarios. To address these limitations, we propose UniRank, a VLM-based reranking framework that natively scores and orders hybrid text-image candidates without any modality conversion. Building on this hybrid scoring interface, UniRank provides an end-to-end domain adaptation pipeline that includes: (1) an instruction-tuning stage that learns calibrated cross-modal relevance scoring by mapping label-token likelihoods to a unified scalar score; and (2) a hard-negative-driven preference alignment stage that constructs in-domain pairwise preferences and performs query-level policy optimization through reinforcement learning from human feedback (RLHF). Extensive experiments on scientific literature retrieval and design patent search demonstrate that UniRank consistently outperforms state-of-the-art baselines, improving Recall@1 by 8.9% and 7.3%, respectively.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。