The algorithms available for retail forecasting have increased in complexity. Newer methods, such as machine learning, are inherently complex. The more traditional families of forecasting models, such as exponential smoothing and autoregressive integrated moving averages, have expanded to contain multiple possible forms and forecasting profiles. We question complexity in forecasting and the need to consider such large families of models. Our argument is that parsimoniously identifying suitable subsets of models will not decrease forecasting accuracy nor will it reduce the ability to estimate forecast uncertainty. We propose a framework that balances forecasting performance versus computational cost, resulting in the consideration of only a reduced set of models. We empirically demonstrate that a reduced set performs well. Finally, we translate computational benefits to monetary cost savings and environmental impact and discuss the implications of our results in the context of large retailers.
翻译:用于零售预报的算法更加复杂,机器学习等新方法本来就很复杂。更传统的预测模型,如指数平滑和自动递减综合移动平均数,已经扩大,包含多种可能的形式和预测概况。我们质疑预测的复杂性和考虑这种模型的庞大类别的必要性。我们的论点是,巧妙地确定适当的模型子集不会降低预测准确性,也不会降低预测不确定性的能力。我们提出了一个平衡预测业绩和计算成本的框架,只考虑一套减少的模型。我们从经验上证明,减少的一套模型运行良好。最后,我们将计算效益转化为货币成本节约和环境影响,并讨论在大型零售商背景下我们的结果的影响。