arXiv:2511.09966cs.CL2025-11

REAP通过递归评估与自适应规划,提升多跳问答的推理准确性。

REAP: Enhancing RAG with Recursive Evaluation and Adaptive Planning for Multi-Hop Question Answering

  • 构建子任务规划器与事实提取器,动态维护全局推理路径。
  • 在多个公开数据集上超越现有RAG方法,跨域表现更优。
  • 适合需要高可靠推理的复杂问答场景,尤其数据稀缺时效果显著。

检索增强生成(RAG)被广泛用于缓解大语言模型的幻觉问题。然而,现有方法在多跳推理任务中常缺乏全局规划,易陷入局部推理困境;对检索内容利用不足,忽视潜在线索,影响推理结果的准确性。为此,我们提出递归评估与自适应规划(REAP),其核心是通过子任务规划器(SP)和事实提取器(FE)模块显式维护与当前任务相关的结构化子任务与事实。SP保持全局视角,根据FE输出评估任务状态,动态优化求解轨迹;FE对检索内容进行细粒度分析,提取可靠答案与线索。两个模块逐步构建逻辑连贯的全局知识表征,提升推理的可靠性与可追溯性。此外,我们设计统一的任务范式,支持多任务微调,显著提升SP在复杂、数据稀缺任务中的表现。在多个公开多跳数据集上的实验表明,本方法在域内与域外设置下均显著优于现有RAG方法,验证了其在复杂多跳推理任务中的有效性。

原文摘要 · Abstract (English)

Retrieval-augmented generation (RAG) has been extensively employed to mitigate hallucinations in large language models (LLMs). However, existing methods for multi-hop reasoning tasks often lack global planning, increasing the risk of falling into local reasoning impasses. Insufficient exploitation of retrieved content and the neglect of latent clues fail to ensure the accuracy of reasoning outcomes. To overcome these limitations, we propose Recursive Evaluation and Adaptive Planning (REAP), whose core idea is to explicitly maintain structured sub-tasks and facts related to the current task through the Sub-task Planner (SP) and Fact Extractor (FE) modules. SP maintains a global perspective, guiding the overall reasoning direction and evaluating the task state based on the outcomes of FE, enabling dynamic optimization of the task-solving trajectory. FE performs fine-grained analysis over retrieved content to extract reliable answers and clues. These two modules incrementally enrich a logically coherent representation of global knowledge, enhancing the reliability and the traceability of the reasoning process. Furthermore, we propose a unified task paradigm design that enables effective multi-task fine-tuning, significantly enhancing SP's performance on complex, data-scarce tasks. We conduct extensive experiments on multiple public multi-hop datasets, and the results demonstrate that our method significantly outperforms existing RAG methods in both in-domain and out-of-domain settings, validating its effectiveness in complex multi-hop reasoning tasks.

多跳问答RAG推理规划LLM

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