arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2602.05030stat.ME
收藏

数十亿级预测协调

Billions-Scale Forecast Reconciliation

Johns Hopkins University(约翰斯·霍普金斯大学);Amazon(亚马逊)

Tianyu Wang, Matthew C. Johnson, Steven Klee, Matthew L. Malloy

AI总结:

本文提出了一种针对数十亿级预测协调问题的优化方法,展示了其在大规模数据下的有效性,并理论证明了最小二乘协调与基于份额协调的等价性。

摘要:

将多个相关量的预测结合在一起,这些量遵循预期相等性和可加性约束的问题,通常被称为分层预测协调,可以自然地表述为一个简单的优化问题。在本文中,我们探索了在大型零售商面临的规模下基于优化的点预测协调方法。我们实现了并测试了几种算法来解决预测协调问题,证明当问题的维度超过40亿个预测值时,该方法是有效的。据我们所知,这可能是最大的预测协调问题,可能与迄今为止解决的最大约束最小二乘问题相当。我们还做出了几个理论贡献。我们证明,对于受限类别的问题,当损失函数适当加权时,最小二乘预测协调等同于基于份额的预测协调。这阐明了基于优化的方法如何被视为基于份额协调的推广,适用于多个、重叠的数据层级。

英文摘要:

The problem of combining multiple forecasts of related quantities that obey expected equality and additivity constraints, often referred to a hierarchical forecast reconciliation, is naturally stated as a simple optimization problem. In this paper we explore optimization-based point forecast reconciliation at scales faced by large retailers. We implement and benchmark several algorithms to solve the forecast reconciliation problem, showing efficacy when the dimension of the problem exceeds four billion forecasted values. To the best of our knowledge, this is the largest forecast reconciliation problem, and perhaps on-par with the largest constrained least-squares-problem ever solved. We also make several theoretical contributions. We show that for a restricted class of problems and when the loss function is weighted appropriately, least-squares forecast reconciliation is equivalent to share-based forecast reconciliation. This formalizes how the optimization based approach can be thought of as a generalization of share-based reconciliation, applicable to multiple, overlapping data hierarchies.

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

↑