Abstract:We address the problem of conformal selection, where an agent must select a minimal subset of options to ensure that at least one ``success'' is identified with a pre-specified target probability $\phi$. While traditional online conformal prediction focuses on maintaining validity for the observed sequence, minimizing the resource cost (efficiency) of such selections, especially under limited feedback, remains a significant challenge. In this work, we consider settings with the most limited ``bandit'' feedback, and demonstrate that the simple Adaptive Conformal Inference (ACI) update rule, when applied to the appropriate control parameter or dual variable, is both adversarially valid, ensuring the success target is met on average for any input sequence (and hence under distribution shifts), and stochastically efficient, achieving sublinear efficiency regret for $i.i.d.$ inputs against an appropriate stochastic benchmark. We show such guarantees under canonical models capturing bandit and semi-bandit feedback to the agent via a unifying algorithmic technique, and analytic framework involving Lyapunov functions. Our approach handles more complex settings than prior work, while requiring significantly less feedback, and our results provide a new theoretical bridge between efficient online learning with limited feedback and distribution-free uncertainty quantification.
| Subjects: | Machine Learning (cs.LG) |
| Cite as: | arXiv:2605.14953 [cs.LG] |
| (or arXiv:2605.14953v1 [cs.LG] for this version) | |
| https://doi.org/10.48550/arXiv.2605.14953 arXiv-issued DOI via DataCite (pending registration) |
Submission history
From: Kamesh Munagala [view email]
[v1]
Thu, 14 May 2026 15:22:46 UTC (603 KB)