GRASP: Graph Agentic Search over Propositions for Multi-hop Question Answering
Stockton Jenkins, Ramya Korlakai Vinayak, Junjie Hu

TL;DR
GRASP is an agentic system for multi-hop question answering that optimizes accuracy and token efficiency by decomposing queries into dependency-aware plans and exploring a hierarchical graph structure.
Contribution
It introduces GRASP, a novel method that dynamically scales retrieval strategies and reduces token usage in multi-hop QA using a hierarchical graph approach.
Findings
Achieves highest accuracy on MuSiQue and 2WikiMultihopQA in open retrieval setting.
Uses 40-50% fewer tokens than IRCoT+HippoRAG2 while maintaining performance.
Outperforms in EM and F1 scores across datasets with 30% fewer tokens.
Abstract
Agentic retrieval improves multi-hop question answering by giving language models autonomy to iteratively gather evidence. Recent work augments these systems with knowledge graphs for structured traversal, but this combination introduces significant cost: expensive graph construction at index time and compounding token usage at inference time. We introduce Graph Agentic Search over Propositions (GRASP), an agentic system that simultaneously optimizes for high accuracy and minimal token usage in multi-hop question answering. Rather than executing a rigid, singular query, GRASP actively coordinates its retrieval strategy by decomposing multi-hop queries into dependency-aware plans. This enables GRASP to dynamically scale the number of sub-agents according to the complexity of the problem. Each sub-agent resolves its single-hop query by exploring a novel three-layer hierarchical graph of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
