Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees

4Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Uncertain knowledge graph embedding (UnKGE) methods learn vector representations that capture both structural and uncertainty information to predict scores of unseen triples. However, existing methods produce only point estimates, without quantifying predictive uncertainty-limiting their reliability in high-stakes applications where understanding confidence in predictions is crucial. To address this limitation, we propose UNKGCP, a framework that generates prediction intervals guaranteed to contain the true score with a user-specified level of confidence. The length of the intervals reflects the model's predictive uncertainty. UNKGCP builds on the conformal prediction framework but introduces a novel nonconformity measure tailored to UnKGE methods and an efficient procedure for interval construction. We provide theoretical guarantees for the intervals and empirically verify these guarantees. Extensive experiments on standard benchmarks across diverse UnKGE methods further demonstrate that the intervals are sharp and effectively capture predictive uncertainty. To support future research on this topic, we release our code.

Cite

CITATION STYLE

APA

Zhu, Y., Wu, J., Wang, Y., Zhou, H., Chen, J., Kharlamov, E., & Staab, S. (2025). Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees. In EMNLP 2025 - 2025 Conference on Empirical Methods in Natural Language Processing, Proceedings of the Conference (pp. 8730–8752). Association for Computational Linguistics (ACL). https://doi.org/10.18653/v1/2025.emnlp-main.441

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free