Metraipolis › archive › dc_c71de40c3574

Tail-Aware Geometry Learning for Conformal Ellipsoids — arXiv:2609.27221

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.27221
License (as archived)
CC0-1.0
Archived
2026-10-08T10:52:04.613Z
SHA-256 of the archived text
42bdf97037d6af8677c902859cc9bb99e7d7f9d40e5985e650b86cba71565c49
Stable URL of this page
https://metraipolis.com/documento/dc_c71de40c3574

How to cite

Tail-Aware Geometry Learning for Conformal Ellipsoids — arXiv:2609.27221 — arXiv (en), https://arxiv.org/abs/2609.27221 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_c71de40c3574 (Metraipolis archive dc_c71de40c3574, sha256 42bdf97037d6af8677c902859cc9bb99e7d7f9d40e5985e650b86cba71565c49)
BibTeX
@misc{dcc71de40c3574,
  title = {Tail-Aware Geometry Learning for Conformal Ellipsoids — arXiv:2609.27221},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.27221},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_c71de40c3574; sha256 42bdf97037d6af8677c902859cc9bb99e7d7f9d40e5985e650b86cba71565c49},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.27221. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

This paper studies multivariate conformal prediction (CP), a distribution-free uncertainty quantification framework with finite-sample coverage guarantees. The efficiency of multivariate prediction sets hinges critically on the residual geometry encoded by the nonconformity score, while existing minimum-volume methods rely on quantile thresholds that ignore tail residual severity and implicitly bind geometry learning to coverage level. We propose a tail-aware geometry learning framework for conformal ellipsoids that decouples tail sensitivity in geometry learning from the final coverage guarantee. Using a two-split design, we learn the metric matrix via volume minimization under a CVaR constraint on an estimation split, then apply standard conformal calibration on a held-out calibration split. The resulting problem is convex and admits a bounded-reweighting interpretation that prioritizes high-residual samples. Moreover, we theoretically characterize the trade-off between ellipsoidal volume and tail severity. Experimental results demonstrate the effectiveness of the proposed method.

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-24 in cs.LG).
Categorie arXiv: Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2609.27221 — 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-08T10:06:16.710Z dalla pagina https://arxiv.org/catchup/cs.LG/2026-09-24?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).