Metraipolis › archive › dc_02dd8eee896b
Adaptive conformal prediction on the Grassmannian — arXiv:2610.23508
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.23508
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-19T09:21:27.612Z
- SHA-256 of the archived text
f60f2151333718885f22b1ac6a72941d32c452ced138f00319bf0e29e57d362e- Stable URL of this page
https://metraipolis.com/documento/dc_02dd8eee896b
How to cite
Adaptive conformal prediction on the Grassmannian — arXiv:2610.23508 — arXiv (en), https://arxiv.org/abs/2610.23508 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_02dd8eee896b (Metraipolis archive dc_02dd8eee896b, sha256 f60f2151333718885f22b1ac6a72941d32c452ced138f00319bf0e29e57d362e)
BibTeX
@misc{dc02dd8eee896b,
title = {Adaptive conformal prediction on the Grassmannian — arXiv:2610.23508},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.23508},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_02dd8eee896b; sha256 f60f2151333718885f22b1ac6a72941d32c452ced138f00319bf0e29e57d362e},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.23508. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
We introduce a conformal prediction framework for regression with Grassmann-valued responses. The proposed method constructs prediction regions in the form of metric balls directly on the Grassmann manifold, using basis-invariant geometric distances as non-conformity measures and scaling the corresponding non-conformity scores through a learned prediction difficulty estimator. This yields locally adaptive, input-dependent prediction regions that respect the underlying manifold geometry, while retaining the finite-sample marginal coverage guarantee of split conformal prediction under exchangeability. We evaluate several Grassmannian distance metrics and compare their prediction-region efficiency on synthetic benchmarks and an airfoil inverse shape-design problem. The results highlight the advantages of geometry-aware non-conformity scores, while local adaptation improves empirical coverage uniformity across prediction difficulty levels and, in strongly heteroscedastic settings, can substantially reduce prediction-region size while maintaining the target 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). Pagina del lavoro: https://arxiv.org/abs/2610.23508 — 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-10-19T09:17:41.721Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).