Table of Contents
Fetching ...

Generate-on-Graph: Treat LLM as both Agent and KG in Incomplete Knowledge Graph Question Answering

Yao Xu, Shizhu He, Jiabei Chen, Zihao Wang, Yangqiu Song, Hanghang Tong, Guang Liu, Kang Liu, Jun Zhao

TL;DR

<3-5 sentence high-level summary> The paper introduces Incomplete Knowledge Graph QA (IKGQA) to reflect real-world KG limitations and proposes Generate-on-Graph (GoG), a training-free framework that uses a Thinking-Searching-Generating loop to let LLMs act as both agents navigating KGs and as generators of missing triples. By constructing two IKGQA datasets from WebQSP and CWQ with controlled incompleteness, the authors demonstrate that GoG can outperform prior Semantic Parsing and Retrieval Augmented methods, especially when crucial triples are omitted. GoG’s ability to generate and verify new factual triples while leveraging KG context enables stronger integration of internal LLM knowledge with external KG evidence, and its robustness is shown across multiple LLM backbones and incompleteness levels. The work highlights practical implications for more reliable LLM-KG QA in open-world settings and outlines avenues to mitigate hallucination and further improve performance.

Abstract

To address the issues of insufficient knowledge and hallucination in Large Language Models (LLMs), numerous studies have explored integrating LLMs with Knowledge Graphs (KGs). However, these methods are typically evaluated on conventional Knowledge Graph Question Answering (KGQA) with complete KGs, where all factual triples required for each question are entirely covered by the given KG. In such cases, LLMs primarily act as an agent to find answer entities within the KG, rather than effectively integrating the internal knowledge of LLMs and external knowledge sources such as KGs. In fact, KGs are often incomplete to cover all the knowledge required to answer questions. To simulate these real-world scenarios and evaluate the ability of LLMs to integrate internal and external knowledge, we propose leveraging LLMs for QA under Incomplete Knowledge Graph (IKGQA), where the provided KG lacks some of the factual triples for each question, and construct corresponding datasets. To handle IKGQA, we propose a training-free method called Generate-on-Graph (GoG), which can generate new factual triples while exploring KGs. Specifically, GoG performs reasoning through a Thinking-Searching-Generating framework, which treats LLM as both Agent and KG in IKGQA. Experimental results on two datasets demonstrate that our GoG outperforms all previous methods.

Generate-on-Graph: Treat LLM as both Agent and KG in Incomplete Knowledge Graph Question Answering

TL;DR

<3-5 sentence high-level summary> The paper introduces Incomplete Knowledge Graph QA (IKGQA) to reflect real-world KG limitations and proposes Generate-on-Graph (GoG), a training-free framework that uses a Thinking-Searching-Generating loop to let LLMs act as both agents navigating KGs and as generators of missing triples. By constructing two IKGQA datasets from WebQSP and CWQ with controlled incompleteness, the authors demonstrate that GoG can outperform prior Semantic Parsing and Retrieval Augmented methods, especially when crucial triples are omitted. GoG’s ability to generate and verify new factual triples while leveraging KG context enables stronger integration of internal LLM knowledge with external KG evidence, and its robustness is shown across multiple LLM backbones and incompleteness levels. The work highlights practical implications for more reliable LLM-KG QA in open-world settings and outlines avenues to mitigate hallucination and further improve performance.

Abstract

To address the issues of insufficient knowledge and hallucination in Large Language Models (LLMs), numerous studies have explored integrating LLMs with Knowledge Graphs (KGs). However, these methods are typically evaluated on conventional Knowledge Graph Question Answering (KGQA) with complete KGs, where all factual triples required for each question are entirely covered by the given KG. In such cases, LLMs primarily act as an agent to find answer entities within the KG, rather than effectively integrating the internal knowledge of LLMs and external knowledge sources such as KGs. In fact, KGs are often incomplete to cover all the knowledge required to answer questions. To simulate these real-world scenarios and evaluate the ability of LLMs to integrate internal and external knowledge, we propose leveraging LLMs for QA under Incomplete Knowledge Graph (IKGQA), where the provided KG lacks some of the factual triples for each question, and construct corresponding datasets. To handle IKGQA, we propose a training-free method called Generate-on-Graph (GoG), which can generate new factual triples while exploring KGs. Specifically, GoG performs reasoning through a Thinking-Searching-Generating framework, which treats LLM as both Agent and KG in IKGQA. Experimental results on two datasets demonstrate that our GoG outperforms all previous methods.
Paper Structure (35 sections, 6 figures, 16 tables, 1 algorithm)

This paper contains 35 sections, 6 figures, 16 tables, 1 algorithm.

Figures (6)

  • Figure 1: Comparison between three Question Answering tasks: (a) LLM only QA, (b) Knowledge Graph QA (KGQA), (c) Incomplete Knowledge Graph QA (IKGQA), where the triple (Cupertino, timezone, Pacific Standard Time) is missing. The yellow and red nodes represent topic and answer entity, respectively.
  • Figure 2: Three paradigms for combining LLMs with KGs.
  • Figure 3: Comparison of three methods in solving IKGQA: (a) Semantic parsing based method (e.g., ChatKBQA luo2023chatkbqa), (b) Path retrieval method (e.g., ToG tog_2023), (c) The proposed GoG with Thinking-Searching-Generating framework.
  • Figure 4: The Hits@1 scores of GoG with different number of related triples in the Generate Action on the CWQ (a) and WebQSP (b) (%). The backbone LLM is Qwen-1.5-72b-chat.
  • Figure 5: An example of compound value types (CVTs) in Freebase dataset. Blue, green and orange nodes denote normal entities, CVT node and property node.
  • ...and 1 more figures