Metraipolis › archive › dc_ba0775edd5c6
Finite-Sample Optimal Conformal Prediction Sets under Covariate Shift — arXiv:2610.37866
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.37866
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-01T02:26:49.076Z
- SHA-256 of the archived text
3d16ffcb8eeb6209162a3236c6cccfd97fafcc5663c61347a966a24728695d4a- Stable URL of this page
https://metraipolis.com/documento/dc_ba0775edd5c6
How to cite
Finite-Sample Optimal Conformal Prediction Sets under Covariate Shift — arXiv:2610.37866 — arXiv (en), https://arxiv.org/abs/2610.37866 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ba0775edd5c6 (Metraipolis archive dc_ba0775edd5c6, sha256 3d16ffcb8eeb6209162a3236c6cccfd97fafcc5663c61347a966a24728695d4a)
BibTeX
@misc{dcba0775edd5c6,
title = {Finite-Sample Optimal Conformal Prediction Sets under Covariate Shift — arXiv:2610.37866},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.37866},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ba0775edd5c6; sha256 3d16ffcb8eeb6209162a3236c6cccfd97fafcc5663c61347a966a24728695d4a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.37866. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We study conformal prediction under covariate shift with a known covariate density ratio, seeking prediction sets with minimum expected length under the target distribution. For every calibration sample size, we prove that the rule combining the inverse conditional-density score with randomized weighted conformal calibration minimizes this expected length among all rules valid over the full weighted-exchangeability class. We approximate the oracle using quantile and kernel histograms, including forest-weighted estimators, and select estimators and tuning parameters by resampling to estimate calibrated target length. On a bounded response domain, we bound excess length linearly in $L^1$ density error at fixed calibration size, without requiring a uniform positive lower bound on the true density. We also bound selection-pool and resampling errors. Under explicit growth conditions, the selected procedure approaches the same oracle while the calibration size remains fixed. Experiments on 36 known-density configurations and four public regression datasets compare coverage, prediction-set length, and runtime with existing methods. In targeted low-coverage and strong-shift comparisons, inverse-density selection yields shorter mean sets in most cases and lower mean runtime than the evaluated weighted baselines, with some differences in achieved coverage. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Combinatorics (math.CO); Probability (math.PR); Statistics Theory (math.ST). Pagina del lavoro: https://arxiv.org/abs/2610.37866 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-11-01T02:12:44.233Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).