Cited by 37Topic ModelingMultimodal Machine Learning ApplicationsAdvanced Graph Neural Networks

Knowledge Graph-Enhanced Large Language Models via Path Selection

Open access
Liu, Haochen, Wang, Song, Zhu, Yaochen, Dong, Yushun, Li, Jundong·2024·Findings of the Association for Computational Linguistics ACL 2024

Abstract

Large Language Models (LLMs) have shown unprecedented performance in various realworld applications.However, they are known to generate factually inaccurate outputs, a.k.a. the hallucination problem.In recent years, incorporating external knowledge extracted from Knowledge Graphs (KGs) has become a promising strategy to improve the factual accuracy of LLM-generated outputs.Nevertheless, most existing explorations rely on LLMs themselves to perform KG knowledge extraction, which is highly inflexible as LLMs can only provide binary judgment on whether a certain knowledge (e.g., a knowledge path in KG) should be used.In addition, LLMs tend to pick only knowledge with direct semantic relationship with the input text, while potentially useful knowledge with indirect semantics can be ignored.In this work, we propose a principled framework KELP with three stages to handle the above problems.Specifically, KELP is able to achieve finer granularity of flexible knowledge extraction by generating scores for knowledge paths with input texts via latent semantic matching.Meanwhile, knowledge paths with indirect semantic relationships with the input text can also be considered via trained encoding between the selected paths in KG and the input text.Experiments on real-world datasets validate the effectiveness of KELP. 1 Input: Verify this claim.Is this claim true or false?Context: ["Akita Prefecture", "specialty", "Akita Inu"] Claim: Akita Prefecture is located in Japan.Output: True.√ Input: Verify this claim.Is this claim true or false?Context: ["Akita Prefecture", "locate", "Japan"] Claim:

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2024.findings-acl.376

Cites

0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • EPR enumerates all possible paths from an entity to every reachable node within the graph or subgraph, capturing diverse reasoning chains but potentially introducing query-irrelevant information that adds noise to LLM reasoning.

    “EPR[65] enumerates all possible paths from an entity 𝑣 ( 𝑞 ) 𝑖 ∈ 𝜖 𝑞 to every reachable node within the graph or subgraph. It captures diverse reasoning chains, providing additional context for LLMs, although it may introduce information that is not related to the query, potentially adding noise to the reasoning process of the LLMs.”

    From LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration (2025) · cites this paper as [65]

    Section 3.1 says KELP extracts paths starting from question entities, and Section 3.3 says selecting paths helps avoid excessive, irrelevant context. But the paper describes KELP rather than EPR, and its extraction is limited to one- and two-hop paths; it does not support the claim that EPR enumerates every path to every reachable node. (LLM, conf=0.82)

    Experimental — accuracy not yet measured
  • Domain-specific fine-tuning can further enhance these models' performance, though it comes at an additional cost.

    “Domain-specific fine-tuning can further enhance these models' performance [45, 65, 71, 72], though it comes at an additional cost.”

    From LEGO-GraphRAG: Modularizing Graph-Based Retrieval-Augmented Generation for Design Space Exploration (2025) · cites this paper as [65]

    Section 5.1 (page unavailable) describes fine-tuning for downstream tasks as laborious, supporting the additional-cost point. It does not say that domain-specific fine-tuning further improves model performance; the paper instead discusses prompt engineering and knowledge-graph path selection. (LLM, conf=0.78)

    Experimental — accuracy not yet measured
  • Existing GraphRAG studies have demonstrated the potential of integrating graph data management techniques with GraphRAG.

    “Existing GraphRAG studies [22, 45, 50, 65, 71, 72, 74, 98] have demonstrated the potential of integrating graph data management techniques with GraphRAG.”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

The publisher hasn’t deposited this paper’s reference list.

Research works printed but not linked: 17

  1. Yejin Bang, Samuel Cahyawijaya, Nayeon Lee, Wen- liang Dai, Dan Su, Bryan Wilie, Holy Lovenia, Ziwei Ji, Tiezheng Yu, Willy Chung, et al. 2023. A multi- task, multilingual, multimodal evaluation of chatgpt on reasoning, hallucination, and interactivity. arXiv preprint arXiv:2302.04023. · arXiv
  2. Tom B. Brown, Benjamin Mann, Nick Ryder, Melanie Subbiah, Jared Kaplan, Prafulla Dhariwal, Arvind Neelakantan, Pranav Shyam, Girish Sastry, Amanda Askell, Sandhini Agarwal, Ariel Herbert-Voss, Gretchen Krueger, Tom Henighan, Rewon Child, Aditya Ramesh, Daniel M. Ziegler, Jeffrey Wu, Clemens Winter, Christopher Hesse, Mark Chen, Eric Sigler, Mateusz Litwin, Scott Gray, Benjamin Chess, Jack Clark, Christopher Berner, Sam McCandlish, Alec Radford, Ilya Sutskever, and Dario Amodei. 2020. Language models are few-shot learners. In NeurIPS.
  3. Xiaojun Chen, Shengbin Jia, and Yang Xiang. 2020. A review: Knowledge reasoning over knowledge graph. Expert Systems with Applications.
  4. Jinhao Jiang, Kun Zhou, Xin Zhao, and Ji-Rong Wen. 2023b. Unikgqa: Unified retrieval and reasoning for solving multi-hop question answering over knowl- edge graph. In ICLR.
  5. Jiho Kim, Yeonsu Kwon, Yohan Jo, and Edward Choi. 2023a. KG-GPT: A general framework for reasoning on knowledge graphs using large language models. In EMNLP.
  6. Ilya Loshchilov and Frank Hutter. 2018. Decoupled weight decay regularization. In ICLR.
  7. Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J. Liu. 2020. Exploring the limits of transfer learning with a unified text-to-text trans- former. JMLR.
  8. Hugo Touvron, Thibaut Lavril, Gautier Izacard, Xavier Martinet, Marie-Anne Lachaux, Timothée Lacroix, Baptiste Rozière, Naman Goyal, Eric Hambro, Faisal Azhar, et al. 2023. Llama: Open and effi- cient foundation language models. arXiv preprint arXiv:2302.13971. · arXiv
  9. Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, Łukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In NeurIPS, volume 30.
  10. Siyuan Wang, Zhongyu Wei, Jiarong Xu, Taishan Li, and Zhihao Fan. 2023. Unifying structure reasoning and language model pre-training for complex reason- ing. arXiv preprint arXiv:2301.08913. · arXiv
  11. Song Wang, Zhen Tan, Ruocheng Guo, and Jundong Li. 2023a. Noise-robust fine-tuning of pretrained language models via external guidance. In EMNLP.
  12. Song Wang, Yaochen Zhu, Haochen Liu, Zaiyi Zheng, Chen Chen, et al. 2023b. Knowledge editing for large language models: A survey. arXiv preprint arXiv:2310.16218. · arXiv
  13. Yaqing Wang, Song Wang, Yanyan Li, and Dejing Dou. 2022. Recognizing medical search query intent by few-shot learning. In Proceedings of the 45th Inter- national ACM SIGIR Conference on Research and Development in Information Retrieval, pages 502- 512.
  14. Yaqing Wang, Song Wang, Quanming Yao, and Dejing Dou. 2021b. Hierarchical heterogeneous graph repre- sentation learning for short text classification. CoRR, abs/2111.00180. · arXiv
  15. Jason Wei, Yi Tay, Rishi Bommasani, Colin Raffel, Barret Zoph, Sebastian Borgeaud, Dani Yogatama, Maarten Bosma, Denny Zhou, Donald Metzler, Ed H. Chi, Tatsunori Hashimoto, Oriol Vinyals, Percy Liang, Jeff Dean, and William Fedus. 2022. Emer- gent abilities of large language models. TMLR.
  16. Xuansheng Wu, Haiyan Zhao, Yaochen Zhu, Yucheng Shi, Fan Yang, Tianming Liu, Xiaoming Zhai, Wenlin Yao, Jundong Li, Mengnan Du, et al. 2024. Usable xai: 10 strategies towards exploiting explainability in the llm era. arXiv preprint arXiv:2403.08946. · arXiv
  17. Yaochen Zhu, Liang Wu, Qi Guo, Liangjie Hong, and Jundong Li. 2024. Collaborative large language model for recommender systems. In WWW, pages 3162-3172.

Cited by

Sorted by citations

Authors
Liu, H., Wang, S., Zhu, Y., Dong, Y., & Li, J.
Affiliations
University of Virginia (US)
Venue
Findings of the Association for Computational Linguistics ACL 2024
Published
2024
Pages
6311-6321
OpenAlex
W4402683926
Cited by
28
References
0
Citations by year
2026: 15 · 2025: 9 · 2024: 4
FWCI
8.28
Type
conference paper
Language
en
Open access
Licence
cc-by
Locations
Findings of the Association for Computational Linguistics: ACL (Findings of ACL) (publishedVersion, cc-by)
Funders
  • National Science Foundation (2223769, 2144209, 2228534, 2154962, 2006844)
  • Cisco Systems
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Topic Modeling
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Multimodal Machine Learning Applications
  • Physical Sciences › Computer Science › Artificial Intelligence › Advanced Graph Neural Networks
Keywords
knowledge graphs, large language models, hallucinations, factual accuracy, knowledge extraction, claim verification, kelp

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review