Improved Online Conformal Prediction via Strongly Adaptive Online Learning

Author name not available (Why is that?)

Publication date: 15 February 2023

Abstract: We study the problem of uncertainty quantification via prediction sets, in an online setting where the data distribution may vary arbitrarily over time. Recent work develops online conformal prediction techniques that leverage regret minimization algorithms from the online learning literature to learn prediction sets with approximately valid coverage and small regret. However, standard regret minimization could be insufficient for handling changing environments, where performance guarantees may be desired not only over the full time horizon but also in all (sub-)intervals of time. We develop new online conformal prediction methods that minimize the strongly adaptive regret, which measures the worst-case regret over all intervals of a fixed length. We prove that our methods achieve near-optimal strongly adaptive regret for all interval lengths simultaneously, and approximately valid coverage. Experiments show that our methods consistently obtain better coverage and smaller prediction sets than existing methods on real-world tasks, such as time series forecasting and image classification under distribution shift.

Has companion code repository: https://github.com/herbps10/adaptiveconformal

This page was built for publication: Improved Online Conformal Prediction via Strongly Adaptive Online Learning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6426603)