A regret-minimization algorithm for online conformal prediction under adversarial semi-bandit feedback achieves long-run coverage guarantees while controlling prediction set size.
Box plots summarize the long-run miscoverage MC(T) across 50 independent runs for α∈ {0.1,0.2,0.3,0.4} under the i.i.d
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Online Conformal Prediction with Adversarial Semi-bandit Feedback via Regret Minimization
A regret-minimization algorithm for online conformal prediction under adversarial semi-bandit feedback achieves long-run coverage guarantees while controlling prediction set size.