Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs
Abstract
Conformal prediction has become increasingly popular for quantifying the uncertainty associated with machine learning models. Recent work in graph uncertainty quantification has built upon this approach for conformal graph prediction. The nascent nature of these explorations has led to conflicting choices for implementations, baselines, and method evaluation. In this work, we analyze the design choices made in the literature and discuss the tradeoffs associated with existing methods. Building on the existing implementations for existing methods, we introduce techniques to scale existing methods to large-scale graph datasets without sacrificing performance. Our theoretical and empirical results justify our recommendations for future scholarship in graph conformal prediction.
Cite
Text
Maneriker et al. "Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs." Transactions on Machine Learning Research, 2025.Markdown
[Maneriker et al. "Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs." Transactions on Machine Learning Research, 2025.](https://mlanthology.org/tmlr/2025/maneriker2025tmlr-conformal/)BibTeX
@article{maneriker2025tmlr-conformal,
title = {{Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs}},
author = {Maneriker, Pranav and Vadlamani, Aditya T. and Srinivasan, Anutam and He, Yuntian and Payani, Ali and Parthasarathy, Srinivasan},
journal = {Transactions on Machine Learning Research},
year = {2025},
url = {https://mlanthology.org/tmlr/2025/maneriker2025tmlr-conformal/}
}