Pith. sign in

REVIEW 3 cited by

Retrieve, Summarize, Plan: Advancing Multi-hop Question Answering with an Iterative Approach

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.13101 v2 pith:L6KJOTXU submitted 2024-07-18 cs.CL cs.AI

classification cs.CLcs.AI
keywords iterativemethodsmulti-hopquestionansweringapproachcontextinformation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Multi-hop question answering is a challenging task with distinct industrial relevance, and Retrieval-Augmented Generation (RAG) methods based on large language models (LLMs) have become a popular approach to tackle this task. Owing to the potential inability to retrieve all necessary information in a single iteration, a series of iterative RAG methods has been recently developed, showing significant performance improvements. However, existing methods still face two critical challenges: context overload resulting from multiple rounds of retrieval, and over-planning and repetitive planning due to the lack of a recorded retrieval trajectory. In this paper, we propose a novel iterative RAG method called ReSP, equipped with a dual-function summarizer. This summarizer compresses information from retrieved documents, targeting both the overarching question and the current sub-question concurrently. Experimental results on the multi-hop question-answering datasets HotpotQA and 2WikiMultihopQA demonstrate that our method significantly outperforms the state-of-the-art, and exhibits excellent robustness concerning context length.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. From Evidence to Trajectory: Abductive Reasoning Path Synthesis for Retrieval-Augmented Generation Agents Development

    cs.CL 2025-09 conditional novelty 6.0 of 10

    A new three-stage pipeline synthesizes executable planner-executor trajectories for RAG agents from QA pairs and evidence, and supervised fine-tuning on these trajectories gives an 8B model large EM gains over publish...

  2. Small Encoders Can Rival Large Decoders in Detecting Groundedness

    cs.CL 2025-06 conditional novelty 4.0 of 10

    Task-specific encoders (e.g., RoBERTa-large) rival large decoders such as Llama-3-8B and GPT-4o on binary groundedness detection, within 5 to 10 accuracy points while requiring one to three orders of magnitude fewer FLOPs.

  3. Continually Self-Improving Language Models for Bariatric Surgery Question--Answering

    cs.CL 2025-05 reject novelty 4.0 of 10

    bRAGgen uses a perplexity threshold to trigger web retrieval and LoRA fine-tuning, improving answers on a new bariatric surgery QA dataset, but the evaluation is confounded by test-time adaptation.

Pith tools