KGLens: Towards Efficient and Effective Knowledge Probing of Large Language Models with Knowledge Graphs
Not on the map. Why?
Abstract (arXiv)
Large Language Models (LLMs) might hallucinate facts, while curated Knowledge Graph (KGs) are typically factually reliable especially with domain-specific knowledge. Measuring the alignment between KGs and LLMs can effectively probe the factualness and identify the knowledge blind spots of LLMs. However, verifying the LLMs over extensive KGs can be expensive. In this paper, we present KGLens, a Thompson-sampling-inspired framework aimed at effectively and efficiently measuring the alignment between KGs and LLMs. KGLens features a graph-guided question generator for converting KGs into natural language, along with a carefully designed importance sampling strategy based on parameterized KG structure to expedite KG traversal. Our simulation experiment compares the brute force method with KGLens under six different sampling methods, demonstrating that our approach achieves superior probing efficiency. Leveraging KGLens, we conducted in-depth analyses of the factual accuracy of ten LLMs across three large domain-specific KGs from Wikidata, composing over 19K edges, 700 relations, and 21K entities. Human evaluation results indicate that KGLens can assess LLMs with a level of accuracy nearly equivalent to that of human annotators, achieving 95.7% of the accuracy rate.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 16 of its 26 references that are in the map. First posted on arXiv 15 Dec 2023.
Builds on
16 of 26 references.
References · 16
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
- 2019Language Models as Knowledge Bases?cited by 1,922
- 2018FEVER: a large-scale dataset for Fact Extraction and VERificationcited by 1,362
- 2022When Not to Trust Language Models: Investigating Effectiveness of Parametric and Non-Parametric Memoriescited by 1,103
- 2022Measuring and Narrowing the Compositionality Gap in Language Modelscited by 1,054
- 2019How Can We Know What Language Models Know?cited by 953
- 2020How Much Knowledge Can You Pack Into the Parameters of a Language Model?cited by 713
- 2020KILT: a Benchmark for Knowledge Intensive Language Taskscited by 571
- 2023Check Your Facts and Try Again: Improving Large Language Models with External Knowledge and Automated Feedbackcited by 351
- 2021Time-Aware Language Models as Temporal Knowledge Basescited by 290
- 2019KagNet: Knowledge-Aware Graph Networks for Commonsense Reasoningcited by 216
- 2022Factuality Enhanced Language Models for Open-Ended Text Generationcited by 200
4 more
- 2021PAQ: 65 Million Probably-Asked Questions and What You Can Do With Themcited by 198
- 2021Can Generative Pre-trained Language Models Serve as Knowledge Bases for Closed-book QA?cited by 62
- 2020Knowledge-Aware Language Model Pretrainingcited by 52
- 2023Assessing the Reliability of Large Language Model Knowledgecited by 13
Built on by
Citing papers per year: 2025: 5.
5 papers.
- 2025Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunitiescited by 30
- 2025Graph-Grounded LLMs: Leveraging Graphical Function Calling to Minimize LLM Hallucinationscited by 4
- 2025Efficient Knowledge Probing of Large Language Models by Adapting Pre-trained Embeddingscited by 3
- 2025Decoding Knowledge in Large Language Models: A Framework for Categorization and Comprehensioncited by 0
- 2025A Graph Perspective to Probe Structural Patterns of Knowledge in Large Language Modelscited by 0
- 2025Efficient Knowledge Probing of Large Language Models by Adapting Pre-trained Embeddings8 Aug 2025
- 2025Large Language Models Meet Knowledge Graphs for Question Answering: Synthesis and Opportunities26 May 2025
- 2025A Graph Perspective to Probe Structural Patterns of Knowledge in Large Language Models25 May 2025
- 2025Graph-Grounded LLMs: Leveraging Graphical Function Calling to Minimize LLM Hallucinations13 Mar 2025
- 2025Decoding Knowledge in Large Language Models: A Framework for Categorization and Comprehension2 Jan 2025