FiDeLiS: Faithful Reasoning in Large Language Model for Knowledge Graph Question Answering
Yuan Sui, Yufei He, Nian Liu, Xiaoxin He, Kun Wang, Bryan Hooi

TL;DR
FiDeLiS is a training-free framework that enhances the factuality and interpretability of large language models in knowledge graph question answering by anchoring answers to verifiable reasoning steps and efficiently traversing KGs.
Contribution
It introduces a unified, training-free framework with step-wise reasoning validation and a Path-RAG module to improve factuality and efficiency in KG-based LLM question answering.
Findings
Improves factual accuracy of LLM responses in KG tasks.
Reduces computational costs with Path-RAG module.
Enhances interpretability of reasoning process.
Abstract
Large Language Models (LLMs) are often challenged by generating erroneous or hallucinated responses, especially in complex reasoning tasks. Leveraging Knowledge Graphs (KGs) as external knowledge sources has emerged as a viable solution. However, existing KG-enhanced methods, either retrieval-based or agent-based, encounter difficulties in accurately retrieving knowledge and efficiently traversing KGs at scale. In this paper, we propose a unified framework, FiDeLiS, designed to improve the factuality of LLM responses by anchoring answers to verifiable reasoning steps retrieved from KGs. To achieve this, we leverage step-wise beam search with a deductive scoring function, allowing the LLM to validate reasoning process step by step, and halt the search once the question is deducible. In addition, we propose a Path-RAG module to pre-select a smaller candidate set for each beam search step,…
Peer Reviews
Decision·Submitted to ICLR 2025
Two components of the proposed method, Path-RAG and Deductive-verification Beam Search, are proven to be effective for KGQA. Extensive experiments are conducted on three benchmarks, including ablation study, analysis experiments and case study.
The novelty of the paper is still limited. Although the paper proposes two useful components including Path-RAG and DVBS for KGQA, and also demonstrates their effectiveness, however, the main method still follows the paradigm of ToG (Think on Graph). In the experiments, (1) the important hyper-parameters such as beam width and depth are different when comparing the proposed method and ToG, which will make the comparison unfair. The paper sets the default beam width as 4 and depth as 4, but ToG
1. The proposed method effectively addresses the reliability issue in reasoning by ensuring each step in the reasoning path can be traced back to the original KG, providing verifiable and interpretable results. 2. The introduction of deductive reasoning verification mechanism offers an innovative solution to the reasoning termination problem, which has been a significant challenge in existing approaches.
1. There are minor writing issues (e.g., redundant "based" in line 203, "questins" misspelling in line 790) that should be addressed. 2. The paper lacks in-depth analysis of why deductive reasoning verification is more suitable for this task compared to traditional logit-based scoring methods. A theoretical or empirical comparison would strengthen this claim. 3. The core assumption in constructing reasoning paths (that earlier timesteps t have reasoning step candidates St with higher semantic si
- The authors' writing is clear, with well-explained methodology. - The authors achieved state-of-the-art performance across multiple KGQA datasets, demonstrating consistent performance improvements.
(The following weaknesses represent my second version, which incorporates feedback from the Associate Program Chairs) - The paper's primary contribution appears incremental, as it primarily combines existing retrieval and ranking mechanisms without introducing fundamentally new theoretical insights or technical innovations - the authors should clarify what specific technical advances differentiate their approach from previous retrieval-augmented systems. - Path-RAG appears to be a complex retr
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTopic Modeling · Advanced Graph Neural Networks · Cognitive Computing and Networks
