Ground-Truth Subgraphs for Better Training and Evaluation of Knowledge Graph Augmented LLMs

Alberto Cattaneo, Carlo Luschi, Daniel Justus
11/6/2025
cs.LGcs.AIcs.CL

No confident code implementation found for this paper.

Abstract

Retrieval of information from graph-structured knowledge bases represents a promising direction for improving the factuality of LLMs. While various solutions have been proposed, a comparison of methods is difficult due to the lack of challenging QA datasets with ground-truth targets for graph retrieval. We present SynthKGQA, an LLM-powered framework for generating high-quality Knowledge Graph Question Answering datasets from any Knowledge Graph, providing the full set of ground-truth facts in the KG to reason over questions. We show how, in addition to enabling more informative benchmarking of KG retrievers, the data produced with SynthKGQA also allows us to train better models.We apply SynthKGQA to Wikidata to generate GTSQA, a new dataset designed to test zero-shot generalization abilities of KG retrievers with respect to unseen graph structures and relation types, and benchmark popular solutions for KG-augmented LLMs on it.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{cattaneo2025groundtruth,
  title  = {Ground-Truth Subgraphs for Better Training and Evaluation of Knowledge Graph Augmented LLMs},
  author = {Alberto Cattaneo and Carlo Luschi and Daniel Justus},
  year   = {2025},
  eprint = {2511.04473},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.04473v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2511.04473.svg)](https://codeofpaper.com/paper/2511.04473)

Discussion