Distribution Free Prediction Sets for Node Classification
Graph Neural Networks (GNNs) are able to achieve high classification accuracy on many important real world datasets, but provide no rigorous notion of predictive uncertainty. Quantifying the confidence of GNN models is difficult due to the dependence between datapoints induced by the graph structure. We leverage recent advances in conformal prediction to construct prediction sets for node classification in inductive learning scenarios. We do this by taking an existing approach for conformal classification that relies on \textit{exchangeable} data and modifying it by appropriately weighting the conformal scores to reflect the network structure. We show through experiments on standard benchmark datasets using popular GNN models that our approach provides tighter and better calibrated prediction sets than a naive application of conformal prediction.
Code (1)
Tasks
ClassificationConformal PredictionInductive LearningNode ClassificationPredictionSimilar Papers 제목 키워드 기반
Conformal Inductive Graph Neural Networks
Conformal prediction (CP) transforms any model's output into prediction sets guaranteed to include (cover) the true label. CP requires exchangeability, a relaxation of the i.i.d. assumption, to obtain a valid distributio…
Conformal PredictionNode ClassificationPredictionvalidUncertainty-Aware Prediction for Graph Neural Networks
Thanks to graph neural networks (GNNs), semi-supervised node classification has shown the state-of-the-art performance in graph data. However, GNNs do not consider any types of uncertainties associated with the class pr…
ClassificationNode ClassificationOut-of-Distribution DetectionPredictionDistribution-free Conformal Prediction for Ordinal Classification
Conformal prediction is a general distribution-free approach for constructing prediction sets combined with any machine learning algorithm that achieve valid marginal or conditional coverage in finite samples. Ordinal cl…
ClassificationConformal PredictionOrdinal ClassificationPrediction+1Distribution-free binary classification: prediction sets, confidence intervals and calibration
We study three notions of uncertainty quantification -- calibration, confidence intervals and prediction sets -- for binary classification in the distribution-free setting, that is without making any distributional assum…
Binary ClassificationClassificationGeneral ClassificationUncertainty QuantificationRobust Optimization as Data Augmentation for Large-scale Graphs
Data augmentation helps neural networks generalize better by enlarging the training set, but it remains an open question how to effectively augment graph data to enhance the performance of GNNs (Graph Neural Networks). W…
Data AugmentationGraph ClassificationLink PredictionNode Classification+2