arXiv:2508.09497cs.CLcs.AI2025-08被引 5

动态选择文档片段,让大模型推理更准

From Ranking to Selection: A Simple but Efficient Dynamic Passage Selector for Retrieval Augmented Generation

  • 把选段当作监督学习问题,捕捉文档间关联
  • 在MuSiQue上比最强基线高30.06%的准确率
  • 无需改原流程,适合复杂多跳问答场景

检索增强生成(RAG)系统常受重排模块瓶颈制约,传统方法独立评分并固定选取前K篇文档,难以处理需跨文档整合证据的复杂多跳查询——小K值遗漏关键信息,大K值引入噪声。为此,我们提出动态文档选择器(DPS),将选段视为有监督学习问题,通过微调捕捉文档间依赖关系,动态选择最相关文档集合。DPS为即插即用模块,无需修改标准RAG流程。在五个基准上的全面评估显示,DPS持续优于现有先进重排器和微调方法。尤其在挑战性数据集MuSiQue上,其F1得分分别比Qwen3-reranker和RankingGPT提升30.06%和15.4%。结果表明,通过实现自适应证据选择,DPS显著增强复杂RAG场景下的推理能力。

原文摘要 · Abstract (English)

Retrieval-augmented generation (RAG) systems are often bottlenecked by their reranking modules, which typically score passages independently and select a fixed Top-K size. This approach struggles with complex multi-hop queries that require synthesizing evidence across multiple documents, creating a trade-off where small K values omit crucial information and large K values introduce noise. To address this, we introduce the Dynamic Passage Selector (DPS), a novel reranking framework that treats passage selection as a supervised learning problem. Unlike traditional point-wise or list-wise methods, DPS is fine-tuned to capture inter-passage dependencies and dynamically select the most relevant set of passages for generation. As a seamless plug-and-play module, DPS requires no modifications to the standard RAG pipeline. Comprehensive evaluations on five benchmarks show that DPS consistently outperforms state-of-the-art rerankers and fine-tuning methods. Notably, on the challenging MuSiQue dataset, DPS improves the F1-score by 30.06% and 15.4% over strong baselines like Qwen3-reranker and RankingGPT, respectively. Our results demonstrate that by enabling adaptive evidence selection, DPS substantially enhances reasoning capabilities in complex RAG scenarios.

检索增强动态选择多跳推理

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