Reliable Reasoning Path: Distilling Effective Guidance for LLM Reasoning with Knowledge Graphs
Yilin Xiao, Chuang Zhou, Qinggang Zhang, Bo Li, Qing Li, Xiao Huang

TL;DR
This paper introduces the RRP framework that enhances LLM reasoning by extracting and refining reliable knowledge graph-based reasoning paths, significantly improving performance on knowledge-intensive tasks.
Contribution
The paper proposes a novel RRP framework that combines semantic and structural analysis of knowledge graphs to generate high-quality reasoning paths for LLMs.
Findings
RRP achieves state-of-the-art results on two public datasets.
RRP can be integrated into various LLMs easily.
Generated reasoning paths improve LLM reasoning accuracy.
Abstract
Large language models (LLMs) often struggle with knowledge-intensive tasks due to a lack of background knowledge and a tendency to hallucinate. To address these limitations, integrating knowledge graphs (KGs) with LLMs has been intensively studied. Existing KG-enhanced LLMs focus on supplementary factual knowledge, but still struggle with solving complex questions. We argue that refining the relationships among facts and organizing them into a logically consistent reasoning path is equally important as factual knowledge itself. Despite their potential, extracting reliable reasoning paths from KGs poses the following challenges: the complexity of graph structures and the existence of multiple generated paths, making it difficult to distinguish between useful and redundant ones. To tackle these challenges, we propose the RRP framework to mine the knowledge graph, which combines the…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Topic Modeling · Multimodal Machine Learning Applications
MethodsFocus
