Combining forecasting procedures: Some theoretical results

被引:131
作者
Yang, YH [1 ]
机构
[1] Iowa State Univ, Dept Stat, Ames, IA 50011 USA
关键词
D O I
10.1017/S0266466604201086
中图分类号
F [经济];
学科分类号
02 ;
摘要
We study some methods of combining procedures for forecasting a continuous random variable. Statistical risk bounds under the square error loss are obtained under distributional assumptions on the future given the current outside information and the past observations. The risk bounds show that the combined forecast automatically achieves the best performance among the candidate procedures up to a constant factor and an additive penalty term. In terms of the rate of convergence, the combined forecast performs as well as if the best candidate forecasting procedure were known in advance. Empirical studies suggest that combining procedures can sometimes improve forecasting accuracy over the original procedures. Risk bounds are derived to theoretically quantify the potential gain and price of linearly combining forecasts for improvement. The result supports the empirical finding that it is not automatically a good idea to combine forecasts. Indiscriminate combining can degrade performance dramatically as a result of the large variability in estimating the best combining weights. An automated combining method is shown in theory to achieve a balance between the potential gain and the complexity penalty (the price of combining), to take advantage (if any) of sparse combining, and to maintain the best performance (in rate) among the candidate forecasting procedures if linear or sparse combining does not help.
引用
收藏
页码:176 / 222
页数:47
相关论文
共 62 条
[1]  
[Anonymous], 1976, TIME SERIES ANAL
[2]  
[Anonymous], 1986, STAT SCI
[3]  
[Anonymous], 52 ONR
[4]   COMBINING FORECASTS - THE END OF THE BEGINNING OR THE BEGINNING OF THE END [J].
ARMSTRONG, JS .
INTERNATIONAL JOURNAL OF FORECASTING, 1989, 5 (04) :585-588
[5]   Risk bounds for model selection via penalization [J].
Barron, A ;
Birgé, L ;
Massart, P .
PROBABILITY THEORY AND RELATED FIELDS, 1999, 113 (03) :301-413
[6]   The minimum description length principle in coding and modeling [J].
Barron, A ;
Rissanen, J ;
Yu, B .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (06) :2743-2760
[7]   UNIVERSAL APPROXIMATION BOUNDS FOR SUPERPOSITIONS OF A SIGMOIDAL FUNCTION [J].
BARRON, AR .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1993, 39 (03) :930-945
[8]  
BARRON AR, 1994, MACH LEARN, V14, P115, DOI 10.1007/BF00993164
[9]   COMBINATION OF FORECASTS [J].
BATES, JM ;
GRANGER, CWJ .
OPERATIONAL RESEARCH QUARTERLY, 1969, 20 (04) :451-&
[10]  
Breiman L, 1996, MACH LEARN, V24, P49