为智能搜索设计可迭代优化的检索器,提升复杂问题回答效果。
Agentic-R: Learning to Retrieve for Agentic Search

- 结合局部相关性和全局答案正确性评估文档价值
- 在7个问答基准上优于现有基线模型
- 适合需要多步推理的智能搜索系统使用
智能搜索作为一种新兴范式,通过将多步推理与按需检索交替进行来解决复杂问题。尽管取得成功,但如何为智能搜索设计检索器仍缺乏深入研究。现有搜索代理通常依赖基于相似性的检索器,但相似段落并不总对最终答案生成有帮助。本文提出一种专为智能搜索设计的新颖检索器训练框架。不同于仅依赖局部段落相关性的单轮检索增强生成(RAG)检索器,我们同时利用查询-段落相关性和全局答案正确性来衡量段落价值。进一步引入迭代训练策略,使搜索代理与检索器双向、持续优化。与仅用固定问题一次性训练的RAG检索器不同,我们的检索器通过代理产生的动态高质量查询不断改进。在七个单跳和多跳问答基准上的实验表明,所提出的检索器( exttt{Agentic-R})在不同搜索代理上均持续优于强基线。代码已公开于:https://github.com/8421BCD/Agentic-R。
原文摘要 · Abstract (English)
Agentic search has recently emerged as a powerful paradigm, where an agent interleaves multi-step reasoning with on-demand retrieval to solve complex questions. Despite its success, how to design a retriever for agentic search remains largely underexplored. Existing search agents typically rely on similarity-based retrievers, while similar passages are not always useful for final answer generation. In this paper, we propose a novel retriever training framework tailored for agentic search. Unlike retrievers designed for single-turn retrieval-augmented generation (RAG) that only rely on local passage utility, we propose to use both local query-passage relevance and global answer correctness to measure passage utility in a multi-turn agentic search. We further introduce an iterative training strategy, where the search agent and the retriever are optimized bidirectionally and iteratively. Different from RAG retrievers that are only trained once with fixed questions, our retriever is continuously improved using evolving and higher-quality queries from the agent. Extensive experiments on seven single-hop and multi-hop QA benchmarks demonstrate that our retriever, termed \ours{}, consistently outperforms strong baselines across different search agents. Our codes are available at: https://github.com/8421BCD/Agentic-R.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。