Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866914121057828864 |
|---|---|
| author | Zhu, Yuqicheng Wu, Jingcheng Wang, Yizhen Zhou, Hongkuan Chen, Jiaoyan Kharlamov, Evgeny Staab, Steffen |
| author_facet | Zhu, Yuqicheng Wu, Jingcheng Wang, Yizhen Zhou, Hongkuan Chen, Jiaoyan Kharlamov, Evgeny Staab, Steffen |
| contents | 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 \textsc{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. \textsc{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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_24754 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees Zhu, Yuqicheng Wu, Jingcheng Wang, Yizhen Zhou, Hongkuan Chen, Jiaoyan Kharlamov, Evgeny Staab, Steffen Machine Learning 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 \textsc{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. \textsc{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. |
| title | Certainty in Uncertainty: Reasoning over Uncertain Knowledge Graphs with Statistical Guarantees |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2510.24754 |