Non-exchangeable Conformal Prediction for Temporal Graph Neural Networks
Tuo Wang, Jian Kang, Yujun Yan, Adithya Kulkarni, Dawei Zhou

TL;DR
This paper introduces NCPNET, a novel conformal prediction framework for temporal graph neural networks that accounts for temporal dependencies, ensuring reliable uncertainty quantification in dynamic graph settings.
Contribution
It extends conformal prediction to dynamic graphs with a diffusion-based non-conformity score and an efficiency-aware optimization algorithm, addressing coverage violations caused by temporal dependencies.
Findings
Ensures guaranteed coverage in temporal graphs.
Reduces prediction set size by up to 31%.
Improves computational efficiency over existing methods.
Abstract
Conformal prediction for graph neural networks (GNNs) offers a promising framework for quantifying uncertainty, enhancing GNN reliability in high-stakes applications. However, existing methods predominantly focus on static graphs, neglecting the evolving nature of real-world graphs. Temporal dependencies in graph structure, node attributes, and ground truth labels violate the fundamental exchangeability assumption of standard conformal prediction methods, limiting their applicability. To address these challenges, in this paper, we introduce NCPNET, a novel end-to-end conformal prediction framework tailored for temporal graphs. Our approach extends conformal prediction to dynamic settings, mitigating statistical coverage violations induced by temporal dependencies. To achieve this, we propose a diffusion-based non-conformity score that captures both topological and temporal uncertainties…
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.
