Online Conformal Prediction with Corrupted Feedback
Bowen Wang, Matteo Zecchin, Osvaldo Simeone

TL;DR
This paper addresses the challenge of maintaining reliable uncertainty estimates in online conformal prediction when feedback is corrupted, proposing robust methods with theoretical guarantees and empirical validation.
Contribution
It introduces two robust schemes for online conformal prediction under corrupted feedback, with explicit miscoverage guarantees and demonstrated effectiveness.
Findings
Robust methods significantly improve calibration under corrupted feedback.
Proposed schemes outperform baseline OCP in real-world experiments.
Explicit guarantees are derived for different corruption models.
Abstract
Modern artificial intelligence systems require calibrated uncertainty estimates that remain reliable in sequential and non-stationary environments. Online conformal prediction (OCP) addresses this challenge through adaptively updated prediction sets that provide deterministic long-run miscoverage guarantees. These guarantees, however, hinge on the assumption of perfect feedback about the coverage of past prediction sets. In practice, the observed miscoverage indicator may be corrupted by noise, communication failures, or adversarial manipulation, which can severely degrade OCP's calibration guarantees. In this paper, we study OCP under corrupted feedback. We first model feedback corruption as an arbitrary binary flip sequence, and analyze how feedback corruption affects and degrades the miscoverage performance of standard OCP. We then propose two robust schemes: robust OCP via…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
