CLIROct 3, 2025

StepChain GraphRAG: Reasoning Over Knowledge Graphs for Multi-Hop Question Answering

arXiv:2510.02827v11 citationsh-index: 13
Originality Highly original
AI Analysis

This work addresses the problem of improving accuracy and explainability in multi-hop question answering for AI systems, representing an incremental advancement over existing retrieval-augmented generation methods.

The paper tackles the challenge of integrating iterative reasoning with external knowledge retrieval in multi-hop question answering by introducing StepChain GraphRAG, a framework that uses question decomposition and BFS-based traversal on knowledge graphs, achieving state-of-the-art results with average EM gains of 2.57% and F1 gains of 2.13% over previous methods.

Recent progress in retrieval-augmented generation (RAG) has led to more accurate and interpretable multi-hop question answering (QA). Yet, challenges persist in integrating iterative reasoning steps with external knowledge retrieval. To address this, we introduce StepChain GraphRAG, a framework that unites question decomposition with a Breadth-First Search (BFS) Reasoning Flow for enhanced multi-hop QA. Our approach first builds a global index over the corpus; at inference time, only retrieved passages are parsed on-the-fly into a knowledge graph, and the complex query is split into sub-questions. For each sub-question, a BFS-based traversal dynamically expands along relevant edges, assembling explicit evidence chains without overwhelming the language model with superfluous context. Experiments on MuSiQue, 2WikiMultiHopQA, and HotpotQA show that StepChain GraphRAG achieves state-of-the-art Exact Match and F1 scores. StepChain GraphRAG lifts average EM by 2.57% and F1 by 2.13% over the SOTA method, achieving the largest gain on HotpotQA (+4.70% EM, +3.44% F1). StepChain GraphRAG also fosters enhanced explainability by preserving the chain-of-thought across intermediate retrieval steps. We conclude by discussing how future work can mitigate the computational overhead and address potential hallucinations from large language models to refine efficiency and reliability in multi-hop QA.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes