Distribution-informed Online Conformal Prediction
Dongjian Hu, Junxi Wu, Shu-Tao Xia, Changliang Zou

TL;DR
This paper introduces Conformal Optimistic Prediction (COP), an online conformal prediction method that adapts to data patterns to produce tighter, valid prediction sets even under distribution shifts and adversarial conditions.
Contribution
The paper proposes COP, a novel online conformal prediction algorithm that incorporates data patterns into updates, achieving tighter prediction sets with valid coverage guarantees.
Findings
COP produces shorter prediction intervals than baselines.
COP maintains valid coverage under distribution shifts.
Experimental results confirm the effectiveness of COP.
Abstract
Conformal prediction provides a pivotal and flexible technique for uncertainty quantification by constructing prediction sets with a predefined coverage rate. Many online conformal prediction methods have been developed to address data distribution shifts in fully adversarial environments, resulting in overly conservative prediction sets. We propose Conformal Optimistic Prediction (COP), an online conformal prediction algorithm incorporating underlying data pattern into the update rule. Through estimated cumulative distribution function of non-conformity scores, COP produces tighter prediction sets when predictable pattern exists, while retaining valid coverage guarantees even when estimates are inaccurate. We establish a joint bound on coverage and regret, which further confirms the validity of our approach. We also prove that COP achieves distribution-free, finite-sample coverage…
Peer Reviews
Decision·ICLR 2026 Poster
The paper is original in recasting online conformal prediction as optimistic online gradient descent, blending a standard feedback step with a CDF guided optimistic refinement to reduce conservativeness. The theory is solid, delivering a joint coverage regret bound, distribution free finite sample coverage for arbitrary learning rates, and convergence under i.i.d. scores, while the presentation is clear with precise setup and actionable pseudocode. Experiments across simulated shifts and multipl
The central theory relies on an unverifiable same sign assumption and boundedness that may fail under nonstationary or heavy tailed regimes; an assumption free, non asymptotic refinement bound based on observable CDF error would strengthen the claims. The simulations omit heteroscedasticity, variance changepoints, and heavy tails, lack ablations isolating the optimistic step and ECDF versus KDE, and do not report recovery time or conditional coverage. Practical clarity and scalability are under
The paper introduces an elegant refinement step using estimated CDFs. Theoretical contributions include finite-sample and asymptotic coverage guarantees, as well as a joint regret–coverage bound under general learning rates.
- Although both empirical and kernel-based CDFs are considered, the impact of different estimators or misspecification on performance and validity is not deeply analyzed. - The presentation could be improved for greater readability. For instance, abbreviations should be used consistently once their full forms have been introduced. Moreover, Sections 3.1–3.3 are mathematically dense, which may make it challenging for readers unfamiliar with OOGD or online conformal prediction to grasp the under
1- The idea of incorporating distribution-informed optimistic updates into online conformal prediction is a meaningful advancement in this area. 2- The paper provides solid theoretical foundations for both coverage and regret. 3-The paper is well written and easy to follow, with clear motivation and smooth storytelling that connects prior work to the proposed method.
Please check the questions.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning · Generative Adversarial Networks and Image Synthesis · Gaussian Processes and Bayesian Inference
