跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究通用预测集与条件覆盖,没有宏观预测或金融收益预测的具体文本依据。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Isaac Gibbs
John J Cherian
Emmanuel J Candès

具有条件覆盖保证的共形预测

研究问题
在普遍精确条件覆盖不可实现的背景下,如何构造连接边际覆盖与条件覆盖的分布无关预测集,并量化覆盖误差?
方法与思路
作者将条件覆盖改写为协变量分布偏移类上的覆盖要求,分别处理有限维和无限维偏移类,并接入分割共形推断。
材料陈述的贡献
摘要称有限维偏移类可同时获得精确有限样本覆盖;更灵活的类可量化覆盖误差,并用可解释超参数调节这些误差。
阅读关注点
应核对偏移类的定义、覆盖概率的具体对象、有限维保证的条件,以及无限维误差界和超参数控制的实际含义。
阅读边界
仅据所给 Crossref 摘要;保证受目标偏移类约束,不能理解为任意条件下均精确覆盖;摘要未说明完整抽样与算法条件。

原文摘要

Abstract We consider the problem of constructing distribution-free prediction sets with finite-sample conditional guarantees. Prior work has shown that it is impossible to provide exact conditional coverage universally in finite samples. Thus, most popular methods only guarantee marginal coverage over the covariates or are restricted to a limited set of conditional targets, e.g. coverage over a finite set of prespecified subgroups. This paper bridges this gap by defining a spectrum of problems that interpolate between marginal and conditional validity. We motivate these problems by reformulating conditional coverage as coverage over a class of covariate shifts. When the target class of shifts is finite-dimensional, we show how to simultaneously obtain exact finite-sample coverage over all possible shifts. For example, given a collection of subgroups, our prediction sets guarantee coverage over each group. For more flexible, infinite-dimensional classes where exact coverage is impossible, we provide a procedure for quantifying the coverage errors of our algorithm. Moreover, by tuning interpretable hyperparameters, we allow the practitioner to control the size of these errors across shifts of interest. Our methods can be incorporated into existing split conformal inference pipelines, and thus can be used to quantify the uncertainty of modern black-box algorithms without distributional assumptions.

笔记与分组