A2RAG: Adaptive Agentic Graph Retrieval for Cost-Aware and Reliable Reasoning

📅 2026-01-29
📈 Citations: 0
Influential: 0
📄 PDF
🤖 AI Summary
This work addresses the inefficiencies in graph-based retrieval-augmented generation caused by mixed-difficulty queries—leading to wasted resources and failed reasoning—as well as the loss of fine-grained information during graph abstraction. To tackle these issues, the authors propose an adaptive, agent-cooperative graph retrieval framework. The framework employs an adaptive controller that dynamically assesses the sufficiency of retrieved evidence and triggers refined retrieval only when necessary. It further integrates an agent-based retriever to intensify retrieval efforts and traces graph signals back to their original textual sources to preserve critical details. Evaluated on HotpotQA and 2WikiMultiHopQA, the approach improves Recall@2 by 9.9 and 11.8 percentage points, respectively, while reducing token consumption and end-to-end latency by approximately 50%, thereby achieving both high reasoning reliability and significant efficiency gains.

Technology Category

Application Category

📝 Abstract
Graph Retrieval-Augmented Generation (Graph-RAG) enhances multihop question answering by organizing corpora into knowledge graphs and routing evidence through relational structure. However, practical deployments face two persistent bottlenecks: (i) mixed-difficulty workloads where one-size-fits-all retrieval either wastes cost on easy queries or fails on hard multihop cases, and (ii) extraction loss, where graph abstraction omits fine-grained qualifiers that remain only in source text. We present A2RAG, an adaptive-and-agentic GraphRAG framework for cost-aware and reliable reasoning. A2RAG couples an adaptive controller that verifies evidence sufficiency and triggers targeted refinement only when necessary, with an agentic retriever that progressively escalates retrieval effort and maps graph signals back to provenance text to remain robust under extraction loss and incomplete graphs. Experiments on HotpotQA and 2WikiMultiHopQA demonstrate that A2RAG achieves +9.9/+11.8 absolute gains in Recall@2, while cutting token consumption and end-to-end latency by about 50% relative to iterative multihop baselines.
Problem

Research questions and friction points this paper is trying to address.

Graph Retrieval-Augmented Generation
mixed-difficulty workloads
extraction loss
multihop question answering
cost-aware reasoning
Innovation

Methods, ideas, or system contributions that make the work stand out.

Adaptive Retrieval
Agentic Reasoning
Graph-RAG
Cost-Aware Inference
Extraction Loss Mitigation
🔎 Similar Papers
No similar papers found.
J
Jiate Liu
University of New South Wales
Z
Zebin Chen
University of New South Wales
S
S. Qiao
Euler AI
M
Mingchen Ju
Euler AI
D
Danting Zhang
B
Bocheng Han
University of New South Wales
S
Shuyue Yu
Sigma Trading Management, Eigenflow AI
Xin Shu
Xin Shu
PHD of SCU
deep learning
J
Jingling Wu
Sigma Trading Management, Eigenflow AI
Dong Wen
Dong Wen
University of New South Wales
DatabaseGraphBig DataAlgorithm
Xin Cao
Xin Cao
University of New South Wales (UNSW)
Spatial DatabasesGeo-Textual DataData ManagementArtificial Intelligence
Guanfeng Liu
Guanfeng Liu
Macquarie University
databasegraph miningsocial network
Z
Zhengyi Yang
University of New South Wales