Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.13102 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911395386228736 |
|---|---|
| author | Razafindrakoto, Davidson Lova Celisse, Alain Lacaille, Jérôme |
| author_facet | Razafindrakoto, Davidson Lova Celisse, Alain Lacaille, Jérôme |
| contents | Full conformal prediction is a framework that implicitly formulates distribution-free confidence prediction regions for a wide range of estimators. However, a classical limitation of the full conformal framework is the computation of the confidence prediction regions, which is usually impossible since it requires training infinitely many estimators (for real-valued prediction for instance). The main purpose of the present work is to describe a generic strategy for designing a tight approximation to the full conformal prediction region that can be efficiently computed. Along with this approximate confidence region, a theoretical quantification of the tightness of this approximation is developed, depending on the smoothness assumptions on the loss and score functions. The new notion of thickness is introduced for quantifying the discrepancy between the approximate confidence region and the full conformal one. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_13102 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Approximate full conformal prediction in an RKHS Razafindrakoto, Davidson Lova Celisse, Alain Lacaille, Jérôme Machine Learning Statistics Theory Full conformal prediction is a framework that implicitly formulates distribution-free confidence prediction regions for a wide range of estimators. However, a classical limitation of the full conformal framework is the computation of the confidence prediction regions, which is usually impossible since it requires training infinitely many estimators (for real-valued prediction for instance). The main purpose of the present work is to describe a generic strategy for designing a tight approximation to the full conformal prediction region that can be efficiently computed. Along with this approximate confidence region, a theoretical quantification of the tightness of this approximation is developed, depending on the smoothness assumptions on the loss and score functions. The new notion of thickness is introduced for quantifying the discrepancy between the approximate confidence region and the full conformal one. |
| title | Approximate full conformal prediction in an RKHS |
| topic | Machine Learning Statistics Theory |
| url | https://arxiv.org/abs/2601.13102 |