arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1505.00475stat.MEecon.GNq-fin.EC
收藏

关于预测组合难题

On the Forecast Combination Puzzle

Wei Qian, Craig A. Rolling, Gang Cheng, Yuhong Yang

AI总结:

本文探讨了预测组合难题的成因,提出多级AFTER策略以解决该问题,通过模拟和实证分析揭示了预测组合场景的重要性。

摘要:

预测组合难题常常被报告为在预测组合文献中,候选预测的简单平均比复杂的组合方法更稳健。这种现象通常被称为“预测组合谜题”。受此谜题的启发,我们探讨了其可能的解释,包括估计误差、无效的加权公式和模型筛选。我们表明,现有的对谜题的理解应通过区分不同的预测组合场景来补充,即组合以适应和组合以改进。在不考虑底层场景的情况下应用组合方法本身可能导致谜题。基于我们的新理解,通过模拟和实证分析揭示了谜题的原因。我们进一步提出了一种多级AFTER策略,该策略可以整合不同组合方法的优势,并智能适应底层场景。特别地,通过将简单平均视为候选预测,所提出的策略被证明可以避免估计误差的高昂成本,并在很大程度上解决预测组合谜题。

英文摘要:

It is often reported in forecast combination literature that a simple average of candidate forecasts is more robust than sophisticated combining methods. This phenomenon is usually referred to as the "forecast combination puzzle". Motivated by this puzzle, we explore its possible explanations including estimation error, invalid weighting formulas and model screening. We show that existing understanding of the puzzle should be complemented by the distinction of different forecast combination scenarios known as combining for adaptation and combining for improvement. Applying combining methods without consideration of the underlying scenario can itself cause the puzzle. Based on our new understandings, both simulations and real data evaluations are conducted to illustrate the causes of the puzzle. We further propose a multi-level AFTER strategy that can integrate the strengths of different combining methods and adapt intelligently to the underlying scenario. In particular, by treating the simple average as a candidate forecast, the proposed strategy is shown to avoid the heavy cost of estimation error and, to a large extent, solve the forecast combination puzzle.

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

↑