REVIEW 7 cited by
Plan*RAG: Efficient Test-Time Planning for Retrieval Augmented Generation
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
read the original abstract
We introduce Plan*RAG, a novel framework that enables structured multi-hop reasoning in retrieval-augmented generation (RAG) through test-time reasoning plan generation. While existing approaches such as ReAct maintain reasoning chains within the language model's context window, we observe that this often leads to plan fragmentation and execution failures. Our key insight is that by isolating the reasoning plan as a directed acyclic graph (DAG) outside the LM's working memory, we can enable (1) systematic exploration of reasoning paths, (2) atomic subqueries enabling precise retrievals and grounding, and (3) efficiency through parallel execution and bounded context window utilization. Moreover, Plan*RAG's modular design allows it to be integrated with existing RAG methods, thus providing a practical solution to improve current RAG systems. On standard multi-hop reasoning benchmarks, Plan*RAG consistently achieves improvements over recently proposed methods such as RQ-RAG and Self-RAG, while maintaining comparable computational costs.
Forward citations
Cited by 7 Pith papers
-
KAMR: Grounding Generation via Knowledge-Aligned Multi-hop Retrieval
Partial-alignment contrastive pretraining plus anchor-then-expand graph retrieval improves multi-hop KG evidence recovery and downstream QA over strong dense and graph RAG baselines.
-
Fishing Out Free Riders: Shapley-Based Reward Attribution for Parallel Reasoning via Reinforcement Learning
Rewarding each parallel reasoning path by Monte-Carlo-Shapley marginal contribution, scored by a generative reward model, lifts Pass@16 on AIME24/AIME25/AMC23 by 4-90% relative over Parallel-R1 with a fifth of the tra...
-
TeaRAG: A Token-Efficient Agentic Retrieval-Augmented Generation Framework
TeaRAG shows that hybrid chunk+triplet retrieval with Personalized PageRank and an iterative process-aware DPO reward keeps QA accuracy while cutting reasoning tokens by roughly 60%.
-
SearchOS-V1: Towards Robust Open-Domain Information-Seeking Agent Collaboration
A multi-agent web-search framework that stores progress in shared evidence, coverage, and failure state reports the best F1 scores among compared baselines on WideSearch (80.3 item F1) and GISA (76.5 set F1).
-
ComposeRAG: A Modular and Composable RAG for Corpus-Grounded Multi-Hop Question Answering
A modular, verifier-driven RAG pipeline with iterative re-decomposition outperforms fine-tuned and agentic baselines on four multi-hop QA benchmarks.
-
Single LLM, Multiple Roles: A Unified Retrieval-Augmented Generation Framework Using Role-Specific Token Optimization
RoleRAG tunes only role-token embeddings on a frozen LLM to run six RAG sub-tasks, reporting improved QA accuracy, but with inconsistent headline numbers and no significance tests.
-
Leveraging LLM-Assisted Query Understanding for Live Retrieval-Augmented Generation
Omni-RAG, a query-rewriting and decomposition pipeline on top of standard retrieval and reranking, achieved rank 2 in the SIGIR 2025 LiveRAG Challenge.
Discussion (0). Continue with ORCID to comment.