Metraipolis › archive › dc_3dcada17c546
Beyond Imputation: Mask-Adaptive Conformal Prediction via Tree Embeddings on General Missing Data Mechanisms — arXiv:2611.01724
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.01724
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:25:09.610Z
- SHA-256 of the archived text
e5d317c93435e1881667bc523f30d4467693b897cff54ae48b3f5b538e0c1028- Stable URL of this page
https://metraipolis.com/documento/dc_3dcada17c546
How to cite
Beyond Imputation: Mask-Adaptive Conformal Prediction via Tree Embeddings on General Missing Data Mechanisms — arXiv:2611.01724 — arXiv (en), https://arxiv.org/abs/2611.01724 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_3dcada17c546 (Metraipolis archive dc_3dcada17c546, sha256 e5d317c93435e1881667bc523f30d4467693b897cff54ae48b3f5b538e0c1028)
BibTeX
@misc{dc3dcada17c546,
title = {Beyond Imputation: Mask-Adaptive Conformal Prediction via Tree Embeddings on General Missing Data Mechanisms — arXiv:2611.01724},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.01724},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_3dcada17c546; sha256 e5d317c93435e1881667bc523f30d4467693b897cff54ae48b3f5b538e0c1028},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.01724. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Conformal prediction (CP) provides a distribution-free framework for uncertainty quantification with finite-sample marginal coverage guarantees. Yet, missing values introduce distributional heterogeneity, where marginal coverage can hide systematic undercoverage for certain missingness patterns. At the same time, existing methods based on distances or smoothness require a continuous representation of partially observed covariates. Although imputation restores continuity, it obscures the missingness patterns and introduces task-dependent overhead. We develop a new CP framework that is \emph{adaptive to missingness patterns}, without imputing covariates. We rely on data augmentation by feature embedding that accounts for missingness. Our framework represents each input with missing values by a tree embedding together with its raw missingness mask, and then learns a regularized quantile score function. Varying the choices for the penalty function and the augmentation enables us to characterize three practically relevant validity levels: exact coordinate-wise validity, exact validity on observed masks, and approximate missingness-conditional guarantees for general mechanisms (MCAR, MAR, MNAR). Experiments on synthetic and real datasets support these guarantees and show that the proposed method reduces miscoverage risk while maintaining informative intervals, especially in non-MCAR settings. These results highlight the practical value of uncertainty quantification that adapts to missingness.
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).
Pagina del lavoro: https://arxiv.org/abs/2611.01724 — 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-03T11:02:37.829Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).