Practical Adversarial Multivalid Conformal Prediction Supplementary Material Osbert Bastani 1, Christopher Jung
–Neural Information Processing Systems
Then, we can use Lemma 3.1 to prove the following lemma. By Observation 3.1, it suffices to upper bound max In this section, we evaluate MVP and compare it to more traditional methods of conformal prediction on a variety of tasks. In each comparison, we use the same model and conformal score for MVP and for the methods we compare against -- the only difference is the type of the conformal prediction wrapper. First in Section B.1 we study a synthetic regression problem in a simple exchangeable (i.i.d.) setting, and compare to split conformal prediction [Lei et al., 2018]. We show that even when we measure only marginal empirical coverage, MVP improves over split conformal prediction when the regression function must be learned. In contrast, our method does not require exchangeability, so we can both train the regression model and calibrate our prediction sets on the entire dataset. Then, we modify our regression problem so that there are 20 overlapping sub-populations, and one of the sub-populations (consisting of half of the data points) has higher label noise.
Neural Information Processing Systems
Feb-10-2025, 06:59:57 GMT