arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2304.01075eess.SYcs.LGcs.SY
收藏

使用线性互补规划的时间序列保形预测区域

Conformal Prediction Regions for Time Series using Linear Complementarity Programming

University of Pennsylvania(宾夕法尼亚大学);University of Southern California(南加州大学)

Matthew Cleaveland, Insup Lee, George J. Pappas, Lars Lindemann

AI总结:

针对时间序列保形预测的保守性问题,提出基于优化的参数化预测误差方法,将其转化为线性互补规划,在保证最优成本的同时减少保守性,并在行人和F16预测案例中验证了有效性。

摘要:

保形预测是一种统计工具,用于生成以高概率有效的机器学习模型预测区域。然而,将保形预测应用于时间序列数据会导致保守的预测区域。实际上,为了在$T$个时间步上获得置信度为$1-δ$的预测区域,先前的工作要求每个单独的预测区域的有效置信度为$1-δ/T$。我们提出了一种基于优化的方法来减少这种保守性,从而在使用学习型时间序列预测器时能够进行长时域规划和验证。我们不再单独考虑每个时间步的预测误差,而是考虑多个时间步上的参数化预测误差。通过在附加数据集上优化这些参数,我们找到了不保守的预测区域。我们证明该问题可以转化为一个混合整数线性互补规划(MILCP),然后将其松弛为线性互补规划(LCP)。此外,我们证明了松弛后的LP与原始MILCP具有相同的最优成本。最后,我们在使用行人轨迹预测器和F16战斗机高度预测器的案例研究中展示了该方法的有效性。

英文摘要:

Conformal prediction is a statistical tool for producing prediction regions of machine learning models that are valid with high probability. However, applying conformal prediction to time series data leads to conservative prediction regions. In fact, to obtain prediction regions over $T$ time steps with confidence $1-δ$, {previous works require that each individual prediction region is valid} with confidence $1-δ/T$. We propose an optimization-based method for reducing this conservatism to enable long horizon planning and verification when using learning-enabled time series predictors. Instead of considering prediction errors individually at each time step, we consider a parameterized prediction error over multiple time steps. By optimizing the parameters over an additional dataset, we find prediction regions that are not conservative. We show that this problem can be cast as a mixed integer linear complementarity program (MILCP), which we then relax into a linear complementarity program (LCP). Additionally, we prove that the relaxed LP has the same optimal cost as the original MILCP. Finally, we demonstrate the efficacy of our method on case studies using pedestrian trajectory predictors and F16 fighter jet altitude predictors.

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

↑