Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > stat > arXiv:2407.01794

Help | Advanced Search

Statistics > Machine Learning

arXiv:2407.01794 (stat)
[Submitted on 1 Jul 2024 (v1) , last revised 9 Oct 2024 (this version, v2)]

Title: Probabilistic Conformal Prediction with Approximate Conditional Validity

Title: 概率保形预测的近似条件有效性

Authors:Vincent Plassier, Alexander Fishkov, Mohsen Guizani, Maxim Panov, Eric Moulines
Abstract: We develop a new method for generating prediction sets that combines the flexibility of conformal methods with an estimate of the conditional distribution $P_{Y \mid X}$. Existing methods, such as conformalized quantile regression and probabilistic conformal prediction, usually provide only a marginal coverage guarantee. In contrast, our approach extends these frameworks to achieve approximately conditional coverage, which is crucial for many practical applications. Our prediction sets adapt to the behavior of the predictive distribution, making them effective even under high heteroscedasticity. While exact conditional guarantees are infeasible without assumptions on the underlying data distribution, we derive non-asymptotic bounds that depend on the total variation distance of the conditional distribution and its estimate. Using extensive simulations, we show that our method consistently outperforms existing approaches in terms of conditional coverage, leading to more reliable statistical inference in a variety of applications.
Abstract: 我们开发了一种新的方法来生成预测集,该方法结合了非形式化方法的灵活性和条件分布$P_{Y \mid X}$的估计。现有的方法,例如非形式化分位数回归和概率非形式化预测,通常只能提供边缘覆盖率保证。相比之下,我们的方法扩展了这些框架以实现近似条件覆盖率,这对许多实际应用至关重要。我们的预测集适应预测分布的行为,即使在高异方差的情况下也使其有效。虽然在没有对潜在数据分布做出假设的情况下,精确的条件保证不可行,但我们推导出非渐近界,这些界依赖于条件分布及其估计之间的总变化距离。通过广泛的模拟,我们表明我们的方法在条件覆盖率方面始终优于现有方法,从而在各种应用中产生更可靠的统计推断。
Comments: 28 pages
Subjects: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Probability (math.PR); Statistics Theory (math.ST); Methodology (stat.ME)
Cite as: arXiv:2407.01794 [stat.ML]
  (or arXiv:2407.01794v2 [stat.ML] for this version)
  https://doi.org/10.48550/arXiv.2407.01794
arXiv-issued DOI via DataCite

Submission history

From: Vincent Plassier [view email]
[v1] Mon, 1 Jul 2024 20:44:48 UTC (2,166 KB)
[v2] Wed, 9 Oct 2024 09:28:33 UTC (4,988 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
view license
Current browse context:
stat
< prev   |   next >
new | recent | 2024-07
Change to browse by:
cs
cs.LG
math
math.PR
math.ST
stat.ME
stat.ML
stat.TH

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号