Conformal Prediction for Class-wise Coverage via Augmented Label Rank Calibration
Yuanjie Shi, Subhankar Ghosh, Taha Belkhouja, Janardhan Rao Doppa, Yan Yan
TL;DR
This work addresses the problem of achieving reliable class-wise (per-class) coverage in conformal prediction for multi-class, often imbalanced tasks. It introduces RC3P, which augments standard conformity-score calibration with label-rank calibration to selectively threshold only reliably-ranked classes, ensuring class-conditional coverage regardless of distribution or model. The authors prove the validity of RC3P's coverage and derive mild conditions under which it yields smaller prediction sets than baseline CCP; they also provide practical guidance for parameter choices to maximize efficiency. Extensive experiments on CIFAR-10/100, mini-ImageNet, and Food-101 show RC3P achieving consistent class-wise coverage with sizable reductions in average prediction set size (e.g., around 26% on average across datasets), highlighting its practical impact for uncertainty quantification in imbalanced settings.
Abstract
Conformal prediction (CP) is an emerging uncertainty quantification framework that allows us to construct a prediction set to cover the true label with a pre-specified marginal or conditional probability. Although the valid coverage guarantee has been extensively studied for classification problems, CP often produces large prediction sets which may not be practically useful. This issue is exacerbated for the setting of class-conditional coverage on imbalanced classification tasks with many and/or imbalanced classes. This paper proposes the Rank Calibrated Class-conditional CP (RC3P) algorithm to reduce the prediction set sizes to achieve class-conditional coverage, where the valid coverage holds for each class. In contrast to the standard class-conditional CP (CCP) method that uniformly thresholds the class-wise conformity score for each class, the augmented label rank calibration step allows RC3P to selectively iterate this class-wise thresholding subroutine only for a subset of classes whose class-wise top-k error is small. We prove that agnostic to the classifier and data distribution, RC3P achieves class-wise coverage. We also show that RC3P reduces the size of prediction sets compared to the CCP method. Comprehensive experiments on multiple real-world datasets demonstrate that RC3P achieves class-wise coverage and 26.25% reduction in prediction set sizes on average.
