arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2507.02496cs.LGcs.DSmath.STstat.MLstat.TH
收藏

带效率保证的在线共形预测

Online Conformal Prediction with Efficiency Guarantees

Department of Computer Science, Northwestern University(计算机科学系,西北大学)

Vaidehi Srinivas

AI总结:

该研究在新型在线共形预测框架下,针对可交换与任意输入序列分别推导了覆盖性与区间效率的理论边界,提出确定性匹配算法实现帕累托最优权衡,填补了经典在线学习未覆盖的场景空白。

摘要:

我们在一种直接优化效率的新型在线框架下研究共形预测问题。在该问题中,给定目标未覆盖率$\alpha>0$和时间范围$T$。在每一天$t \le T$,算法必须输出一个区间$I_t \subseteq [0, 1]$,随后一个点$y_t \in [0, 1]$会被揭示。算法的目标是实现覆盖,即在(接近)$(1 - \alpha)$比例的天数中满足$y_t \in I_t$,同时保持效率,即最小化所输出区间的平均体积(长度)。该问题是构造高效置信区间问题的在线类比。\n 我们针对任意序列和可交换(随机顺序)输入序列研究该问题。对于可交换序列,我们证明可以构造出覆盖率达到$(1 - \alpha) - o(1)$的区间,且其长度的上界为事后能实现覆盖的最优固定区间的长度。然而对于任意序列,我们证明,任何相较于事后最优固定覆盖区间在平均长度上达到$\mu$近似的算法,其错误数量必然比$\alpha T$多出一个乘性因子,该乘性因子取决于$\mu$和问题的纵横比。我们的主要算法成果是一个匹配算法,它可以实现所有帕累托最优的$\mu$与错误数量的组合设置。此外,我们的算法是确定性的,因此对自适应对抗具有鲁棒性。\n 可交换设置与任意设置之间的这种差距与经典在线学习问题形成对比。事实上,我们证明不存在单一算法能同时在任意序列下达到帕累托最优、又在可交换序列下达到最优。在算法层面,我们提出了一种算法,能在两种场景之间实现接近最优的权衡。

英文摘要:

We study the problem of conformal prediction in a novel online framework that directly optimizes efficiency. In our problem, we are given a target miscoverage rate $α> 0$, and a time horizon $T$. On each day $t \le T$ an algorithm must output an interval $I_t \subseteq [0, 1]$, then a point $y_t \in [0, 1]$ is revealed. The goal of the algorithm is to achieve coverage, that is, $y_t \in I_t$ on (close to) a $(1 - α)$-fraction of days, while maintaining efficiency, that is, minimizing the average volume (length) of the intervals played. This problem is an online analogue to the problem of constructing efficient confidence intervals. We study this problem over arbitrary and exchangeable (random order) input sequences. For exchangeable sequences, we show that it is possible to construct intervals that achieve coverage $(1 - α) - o(1)$, while having length upper bounded by the best fixed interval that achieves coverage in hindsight. For arbitrary sequences however, we show that any algorithm that achieves a $μ$-approximation in average length compared to the best fixed interval achieving coverage in hindsight, must make a multiplicative factor more mistakes than $αT$, where the multiplicative factor depends on $μ$ and the aspect ratio of the problem. Our main algorithmic result is a matching algorithm that can recover all Pareto-optimal settings of $μ$ and number of mistakes. Furthermore, our algorithm is deterministic and therefore robust to an adaptive adversary. This gap between the exchangeable and arbitrary settings is in contrast to the classical online learning problem. In fact, we show that no single algorithm can simultaneously be Pareto-optimal for arbitrary sequences and optimal for exchangeable sequences. On the algorithmic side, we give an algorithm that achieves the near-optimal tradeoff between the two cases.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑