Verifiably Robust Conformal Prediction
<|reference_start|>Verifiably Robust Conformal Prediction: Conformal Prediction (CP) is a popular uncertainty quantification method that provides distribution-free, statistically valid prediction sets, assuming that training and test data are exchangeable. In such a case, CP's prediction sets are guaranteed to cover the (unknown) true test output with a user-specified probability. Nevertheless, this guarantee is violated when the data is subjected to adversarial attacks, which often result in a significant loss of coverage. Recently, several approaches have been put forward to recover CP guarantees in this setting. These approaches leverage variations of randomised smoothing to produce conservative sets which account for the effect of the adversarial perturbations. They are, however, limited in that they only support $\ell^2$-bounded perturbations and classification tasks. This paper introduces VRCP (Verifiably Robust Conformal Prediction), a new framework that leverages recent neural network verification methods to recover coverage guarantees under adversarial attacks. Our VRCP method is the first to support perturbations bounded by arbitrary norms including $\ell^1$, $\ell^2$, and $\ell^\infty$, as well as regression tasks. We evaluate and compare our approach on image classification tasks (CIFAR10, CIFAR100, and TinyImageNet) and regression tasks for deep reinforcement learning environments. In every case, VRCP achieves above nominal coverage and yields significantly more efficient and informative prediction regions than the SotA.<|reference_end|>
@article{jeary2024verifiably,
    title={Verifiably Robust Conformal Prediction},
    author={Linus Jeary, Tom Kuipers, Mehran Hosseini, Nicola Paoletti},
    journal={arXiv preprint arXiv:2405.18942},
    year={2024},
    archivePrefix={arXiv},
    eprint={2405.18942},
    primaryClass={cs.LO cs.AI cs.LG}
}