Conformalized Link Prediction on Graph Neural Networks
Tianyi Zhao, Jian Kang, Lu Cheng

TL;DR
This paper introduces a distribution-free, model-agnostic conformal prediction method for link prediction in graph neural networks, providing statistically guaranteed uncertainty estimates and improved efficiency.
Contribution
It pioneers a conformal prediction framework tailored for GNN-based link prediction, incorporating graph structure insights to enhance efficiency and guarantee coverage.
Findings
Achieves desired marginal coverage in link prediction tasks.
Improves efficiency of conformal prediction over baseline methods.
Establishes permutation invariance and statistical guarantees for GNNs.
Abstract
Graph Neural Networks (GNNs) excel in diverse tasks, yet their applications in high-stakes domains are often hampered by unreliable predictions. Although numerous uncertainty quantification methods have been proposed to address this limitation, they often lack \textit{rigorous} uncertainty estimates. This work makes the first attempt to introduce a distribution-free and model-agnostic uncertainty quantification approach to construct a predictive interval with a statistical guarantee for GNN-based link prediction. We term it as \textit{conformalized link prediction.} Our approach builds upon conformal prediction (CP), a framework that promises to construct statistically robust prediction sets or intervals. We first theoretically and empirically establish a permutation invariance condition for the application of CP in link prediction tasks, along with an exact test-time coverage.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Graph Theory and Algorithms · Advanced Graph Neural Networks
MethodsALIGN
