Conformalized Link Prediction on Graph Neural Networks
Tianyi Zhao, Jian Kang, Lu Cheng
摘要
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 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 conformalized link prediction. Our approach builds upon conformal prediction (CP), a framework that promises to construct statistically robust prediction sets or intervals. There are two primary challenges: first, given dependent data like graphs, it is unclear whether the critical assumption in CP -exchangeability -still holds when applied to link prediction. Second, even if the exchangeability assumption is valid for conformalized link prediction, we need to ensure high efficiency, i.e., the resulting prediction set or the interval length is small enough to provide useful information. To tackle these challenges, 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. Leveraging the important structural information in graphs, we then identify a novel and crucial connection between a graph's adherence to the power law distribution and the efficiency of CP. This insight leads to the development of a simple yet effective sampling-based method to align the graph structure with a power law distribution prior to the standard CP procedure. Extensive experiments demonstrate that for conformalized link prediction, our approach achieves the desired marginal coverage while significantly improving the efficiency of CP compared to baseline methods. Our code is available in https://github.com/Aliciaa-svg/CLP . CCS CONCEPTS • Computing methodologies → Artificial intelligence.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper6
- Conformalized Time Series with Semantic FeaturesBaiting Chen, Zhimei Ren, Lu ChengNeurIPS 2024 · 被引用 19 次
- Conformalized Interval Arithmetic with Symmetric CalibrationRui Luo, Zhixin ZhouAAAI 2025 · 被引用 11 次
- ConRAD: Conformal Risk-Aware Neural DatabasesSonia Horchidan, Fabian Zeiher, Xiangyu Shi, Vasiliki Kalavri 等VLDB 2026
- Devil's Hand: Data Poisoning Attacks to Locally Private Graph Learning ProtocolsLongzhu He, Chaozhuo Li, Peng Tang, Li Sun 等KDD 2026
- Quantile-Free Uncertainty Quantification in Graph Neural NetworksSoyoung Park, Hwanjun Song, Sungsu LimICML 2026
它引用的顶会 Paper18
- Open Graph Benchmark: Datasets for Machine Learning on GraphsWeihua Hu, Matthias Fey, Marinka Zitnik, Yuxiao Dong 等NeurIPS 2020 · 被引用 3,935 次
- NodeFormer: A Scalable Graph Structure Learning Transformer for Node ClassificationQitian Wu, Wentao Zhao, Zenan Li, David P. Wipf 等NeurIPS 2022 · 被引用 472 次
- Confident Adaptive Language ModelingTal Schuster, Adam Fisch, Jai Gupta, Mostafa Dehghani 等NeurIPS 2022 · 被引用 394 次
- Mix-n-Match : Ensemble and Compositional Methods for Uncertainty Calibration in Deep LearningJize Zhang, Bhavya Kailkhura, Thomas Yong-Jin HanICML 2020 · 被引用 276 次
- Adaptive Conformal Predictions for Time SeriesMargaux Zaffran, Olivier Féron, Yannig Goude, Julie Josse 等ICML 2022 · 被引用 209 次
相关 Paper
- Uncertainty Quantification over Graph with Conformalized Graph Neural NetworksKexin Huang, Ying Jin, Emmanuel J. Candès, Jure LeskovecNeurIPS 2023 · 被引用 124 次
- Enhancing Trustworthiness of Graph Neural Networks with Rank-Based Conformal TrainingTing Wang, Zhixin Zhou, Rui LuoAAAI 2025 · 被引用 12 次
- Relational Conformal Prediction for Correlated Time SeriesAndrea Cini, Alexander Jenkins, Danilo P. Mandic, Cesare Alippi 等ICML 2025
- Distribution Free Prediction Sets for Node ClassificationJase ClarksonICML 2023 · 被引用 30 次
- Non-exchangeable Conformal Prediction for Temporal Graph Neural NetworksTuo Wang, Jian Kang, Yujun Yan, Adithya Kulkarni 等KDD 2025
