arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2008.00444cs.LGstat.ML
收藏

时间序列群预测的原理与算法:局部性与全局性

Principles and Algorithms for Forecasting Groups of Time Series: Locality and Globality

University of Sydney(悉尼大学);Monash University(莫纳什大学)

Pablo Montero-Manso, Rob J Hyndman

摘要:

预测时间序列的组具有越来越大的实际重要性,例如,预测由零售商提供的多种产品的需求或数据中心内的服务器负载。这个问题的局部方法单独考虑每个时间序列,并将函数或模型拟合到每个序列。全局方法将单个函数拟合到所有序列。对于相似的时间序列组,全局方法优于更成熟的局部方法。然而,最近的结果表明,即使在异构数据集的全局模型的良好性能。这表明全球方法具有更普遍的适用性,可能导致更准确的工具和新的研究情景。通过对时间序列的局部方法和全局方法进行形式化的描述,我们得到了如下结论:1)全局方法并不比局部方法具有更强的约束性,两者都可以产生相同的预测,而不需要对序列的相似性作任何假设。全球模型可以在比以前想象的更广泛的问题上取得成功。2)局部和全局算法的基本推广界。局部方法的复杂性随着集合的大小而增长,而全局方法的复杂性保持不变。在大型数据集中,全局算法可以相当复杂,但仍然可以从更好的泛化中受益。这些界限有助于澄清和支持该领域最近的实验结果,并指导新算法的设计。对于自回归模型类,这意味着全局模型可以比局部方法具有更大的内存。3)在一项广泛的实证研究中,从这些原则中衍生出来的有目的的朴素算法(如全局线性模型或深度网络)可以获得更高的准确性。特别是,全球线性模型可以提供有竞争力的精度与两个数量级的参数比本地的方法。

英文摘要:

Forecasting groups of time series is of increasing practical importance, e.g. forecasting the demand for multiple products offered by a retailer or server loads within a data center. The local approach to this problem considers each time series separately and fits a function or model to each series. The global approach fits a single function to all series. For groups of similar time series, global methods outperform the more established local methods. However, recent results show good performance of global models even in heterogeneous datasets. This suggests a more general applicability of global methods, potentially leading to more accurate tools and new scenarios to study. Formalizing the setting of forecasting a set of time series with local and global methods, we provide the following contributions: 1) Global methods are not more restrictive than local methods, both can produce the same forecasts without any assumptions about similarity of the series. Global models can succeed in a wider range of problems than previously thought. 2) Basic generalization bounds for local and global algorithms. The complexity of local methods grows with the size of the set while it remains constant for global methods. In large datasets, a global algorithm can afford to be quite complex and still benefit from better generalization. These bounds serve to clarify and support recent experimental results in the field, and guide the design of new algorithms. For the class of autoregressive models, this implies that global models can have much larger memory than local methods. 3) In an extensive empirical study, purposely naive algorithms derived from these principles, such as global linear models or deep networks result in superior accuracy. In particular, global linear models can provide competitive accuracy with two orders of magnitude fewer parameters than local methods.

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

↑