Verifiably Robust Conformal Prediction
Linus Jeary, Tom Kuipers, Mehran Hosseini, Nicola Paoletti

TL;DR
This paper introduces VRCP, a novel conformal prediction framework that guarantees coverage under adversarial attacks for various perturbation norms and tasks, outperforming existing methods.
Contribution
VRCP leverages neural network verification to support arbitrary norm-bounded adversarial perturbations and regression, extending conformal prediction's robustness capabilities.
Findings
VRCP achieves above nominal coverage in experiments.
VRCP produces more efficient prediction regions than state-of-the-art methods.
Supports arbitrary norm-bounded adversarial perturbations and regression tasks.
Abstract
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 -bounded perturbations and classification tasks. This paper introduces VRCP (Verifiably Robust Conformal Prediction), a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsNeural Networks and Applications · Face and Expression Recognition · Gaussian Processes and Bayesian Inference
