TL;DR
This paper introduces CS-RAG, a robust GraphRAG framework designed to mitigate retrieval drift and hallucination caused by imperfect knowledge graphs in multi-hop reasoning tasks.
Contribution
It proposes a novel retrieval strategy that handles noise and incompleteness in knowledge graphs without requiring KG repair, enhancing robustness in multi-hop QA.
Findings
CS-RAG reduces hallucination and retrieval drift in experiments.
It remains stable under controlled KG issue injection.
It is less sensitive to builder choice in multi-hop QA.
Abstract
Graph Retrieval-Augmented Generation (GraphRAG) has become a common approach for multi-hop reasoning by using knowledge graphs (KGs) as structured retrieval indexes. However, most existing GraphRAG methods implicitly assume that LLM-constructed KGs provide structural support for evidence chaining. In this paper, we show that this assumption does not always hold in practice through an empirical analysis, and identify two recurring KG issue modes often overlooked by current retrievers: spurious noise and incomplete information. Spurious noise induces retrieval drift toward plausible but unsupported triples, whereas incomplete information leads to retrieval hallucination by forcing continuation through under-supported graph structure. To address these challenges, we propose CS-RAG, a robust GraphRAG framework that mitigates the impact of imperfect KGs during retrieval rather than relying…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Information Retrieval and Search Behavior · Graph Theory and Algorithms
