GRASP: Graph Agentic Search over Propositions for Multi-hop Question Answering

· Source: cs.MA updates on arXiv.org · Field: Technology & Digital — Artificial Intelligence & Machine Learning, Natural Language Processing · Depth: Expert, extended

Summary

GRASP (Graph Agentic Search over Propositions) is a novel agentic retrieval system designed for multi-hop question answering that prioritizes both high accuracy and minimal token usage. It addresses the high cost and token consumption of existing graph-augmented LLM systems by decomposing complex queries into dependency-aware plans, dynamically scaling sub-agents based on problem complexity. Each sub-agent navigates a three-layer hierarchical graph of entities, propositions, and passages, using entities for targeted traversal and propositions for high-recall passage retrieval via reciprocal-rank voting. Evaluated on MuSiQue, 2WikiMultihopQA, and HotpotQA, GRASP achieves superior QA accuracy in open retrieval settings on MuSiQue and 2Wiki, using 40–50% fewer tokens than IRCoT+HippoRAG2. In extended context reasoning (LongBench), GRASP leads on EM and F1 across all three datasets, consuming 30% fewer tokens than the next most accurate method. The system also introduces "success economy" as an efficiency-aware evaluation metric.

Key takeaway

For AI Architects and Research Scientists developing multi-hop QA systems, GRASP offers a compelling blueprint for achieving high accuracy while significantly reducing operational costs. Your teams should consider adopting a hierarchical proposition-based graph structure and a planning-based agentic inference pipeline to manage token usage effectively. This approach can lead to more efficient and scalable deployments, especially for complex reasoning tasks, by minimizing redundant LLM calls and context growth.

Key insights

GRASP optimizes multi-hop QA by combining a hierarchical proposition-based graph with dependency-aware agentic planning for efficiency and accuracy.

Principles

Method

GRASP constructs a three-layer graph (entities, propositions, passages) via joint extraction, then uses a planner to decompose multi-hop questions into sub-questions for independent sub-agents that perform hybrid search and RankVote-based passage retrieval.

In practice

Topics

Best for: Research Scientist, AI Architect, AI Engineer, AI Scientist, Machine Learning Engineer, NLP Engineer

Related on AIssential

Open in AIssential →

Editorial summary, takeaway, and curation by AIssential. Original article published by cs.MA updates on arXiv.org.