让大模型结合BM25分数推理,提升复杂查询的排序效果
InsertRank: LLMs can reason over BM25 scores to Improve Listwise Reranking
- 用大模型融合BM25等词法信号进行列表级重排序
- 在BRIGHT和R2MED基准上分别达37.5和51.1分,优于此前方法
- 适用于医疗、多领域复杂查询场景,适配GPT、Gemini等主流模型
大型语言模型(LLMs)在信息检索任务中表现出色,尤其作为重排序器时,得益于其强大的泛化能力和预训练带来的知识迁移。随着基于LLM的聊天界面兴起,用户提出更复杂的查询,需要通过文档推理而非简单关键词匹配或语义相似性来检索。尽管已有研究利用LLM的推理能力处理此类查询,仍有巨大改进空间。为此,我们提出InsertRank,一种利用BM25等词法信号辅助重排序的LLM重排序器。在涵盖12个领域的推理基准BRIGHT和包含8项任务的医学推理检索基准R2MED上,InsertRank均表现优异。全面评估与消融实验表明,该方法在多个LLM家族(包括GPT、Gemini、Deepseek)上持续提升检索效果。使用Deepseek-R1时,InsertRank在BRIGHT上取得37.5分,在R2MED上取得51.1分,超越现有方法。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have demonstrated significant strides across various information retrieval tasks, particularly as rerankers, owing to their strong generalization and knowledge-transfer capabilities acquired from extensive pretraining. In parallel, the rise of LLM-based chat interfaces has raised user expectations, encouraging users to pose more complex queries that necessitate retrieval by ``reasoning'' over documents rather than through simple keyword matching or semantic similarity. While some recent efforts have exploited reasoning abilities of LLMs for reranking such queries, considerable potential for improvement remains. In that regards, we introduce InsertRank, an LLM-based reranker that leverages lexical signals like BM25 scores during reranking to further improve retrieval performance. InsertRank demonstrates improved retrieval effectiveness on -- BRIGHT, a reasoning benchmark spanning 12 diverse domains, and R2MED, a specialized medical reasoning retrieval benchmark spanning 8 different tasks. We conduct an exhaustive evaluation and several ablation studies and demonstrate that InsertRank consistently improves retrieval effectiveness across multiple families of LLMs, including GPT, Gemini, and Deepseek models. %In addition, we also conduct ablation studies on normalization by varying the scale of the BM25 scores, and positional bias by shuffling the order of the documents. With Deepseek-R1, InsertRank achieves a score of 37.5 on the BRIGHT benchmark. and 51.1 on the R2MED benchmark, surpassing previous methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。