arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2601.01692cs.LG
收藏

增强的多模型在线置信预测

Enhanced Multi-model Online Conformal Prediction

Department of EECS University of California, Irvine Irvine, USA(电子工程与计算机科学系 加州大学尔湾分校 美国尔湾)

Erfan Hajihashemi, Yanning Shen

AI总结:

本研究提出一种增强的多模型在线置信预测算法,通过构建二分图选择有效模型以提高预测效率和计算性能。

摘要:

置信预测是一种用于不确定性量化的方法,通过为以前未见过的数据构建预测集,确保真实标签的覆盖概率。然而,这些预测集的效率,通过其大小来衡量,取决于底层学习模型的选择。依赖单一固定模型可能在在线环境中导致次优性能,因为单一模型可能无法在所有时间步中保持一致的性能。为缓解这一问题,先前的工作探索了从候选模型集中选择模型。然而,随着候选模型数量的增加,这种方法变得计算成本很高。此外,候选集中的表现不佳的模型也可能影响效果。为解决这一挑战,本工作开发了一种新的多模型在线置信预测算法,以减少计算复杂性并提高预测效率。在每个时间步,生成一个二分图以识别有效模型的子集,从中选择一个模型来构建预测集。实验表明,我们的方法在预测集大小和计算效率方面均优于现有的多模型置信预测技术。

英文摘要:

Conformal prediction is a framework for uncertainty quantification that constructs prediction sets for previously unseen data, guaranteeing coverage of the true label with a specified probability. However, the efficiency of these prediction sets, measured by their size, depends on the choice of the underlying learning model. Relying on a single fixed model may lead to suboptimal performance in online environments, as a single model may not consistently perform well across all time steps. To mitigate this, prior work has explored selecting a model from a set of candidates. However, this approach becomes computationally expensive as the number of candidate models increases. Moreover, poorly performing models in the set may also hinder the effectiveness. To tackle this challenge, this work develops a novel multi-model online conformal prediction algorithm that reduces computational complexity and improves prediction efficiency. At each time step, a bipartite graph is generated to identify a subset of effective models, from which a model is selected to construct the prediction set. Experiments demonstrate that our method outperforms existing multi-model conformal prediction techniques in terms of both prediction set size and computational efficiency.

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

↑