Professional Documents
Culture Documents
IMFx
This training material is the property of the International Monetary Fund (IMF) and is intended for use in IMF
Institute for Capacity Development (ICD) courses. Any reuse requires the permission of the ICD.
EViews is a trademark of IHS Global Inc.
Roadmap
M9_Intro. Introduction, Motivations & Outline
M9_S1. Forecast Combination Basics
M9_S2. Solving the Theoretical Combination Problem &
Implementation Issues
M9_S3. Methods to Estimate Weights (M<T)
M9_S4. Methods to Estimate Weights (M>T)
M9_S5. EViews 1: EViews Workshop 1
M9_S6. EViews 2: Forecast Combination Tools in EViews
M9_Conclusion. Conclusions
Module 9
M9_Intro: Introduction, Motivations
& Outline
Introduction
Generally speaking, multiple forecasts are
available to decision makers before they make a
policy decision
Key Question: Given the uncertainty associated
with identifying the true DGP, should a single
(best) forecast be used? Or should we (somehow)
average over all the available forecasts?
Outline
1. Forecast Combination Basics
2. Solving the Theoretical Combination Problem &
Implementation Issues
3. Methods to Estimate & Assign Weights
4. Workshop 1: Combining Forecasts in EViews
5. Workshop 2: EViews Combination Tool
6. Wrap-Up
Module 9
Session 1, Part 1: Forecast
Combination Basics
General Framework
Today (say, at time T) we want to forecast the value
that a variable of interest (Y) will take at time T+h
We have a certain number (M) of forecasts available
How can we pool, or combine these M forecasts into
an optimal forecast?
Is there any advantage of pooling instead of just finding
and using the best one among the M available?
Some Notation
yt is the value of Y at time t (today is T)
xt,h,i is an unbiased (point) forecast of yt+h
made at time t
h is the forecasting horizon
i = 1,M is the identifier of the available forecast
subject to
w
i 1
T , h ,i
T+1
Time
Module 9
Session 1, Part 2: Combining
Prediction Errors
E[ L(eTc h )] E[(eTc h )2 ]
wT ,h ,i 1 then:
Notice that because
i 1
c
T h
i 1
i 1
wT ,h ,i ( yT h xT ,h ,i )
i 1
M
wT ,h ,i eT h ,i
i 1
c
T h
E L wT ,h,ieT h,i
i 1
E ee'
It follows that
M
w
i 1
T , h ,i
u'w
c
T h
2
c
T h
w'ee'w
Module 9
Session 2, Part 1: Solving the
Theoretical Combination Problem
Simple Combination
For now, lets assume that we know the distribution of the forecasting
errors associated to each forecast.
T+1
T h ,2 T h ,1,2
*
weight of xT,h,1
w 2
2
T h,1 T h,2 2 T h ,1,2
2
T h ,1 T h ,1,2
*
weight of xT,h,2
1 w 2
2
T h,1 T h,2 2 T h ,1,2
w
T h ,2 T h ,1,2
2
*
1 w T h ,1 T h ,1,2
*
w'
u'T,h
-1
u'T,h u
-1
(1
T h ,1 T h ,2
T h ,1,2 )
c
* 2
E[(eT h ( w )) ] 2
correlation
2
T h,1 T h,2 2T h,1,2 T h ,1 T h ,2
coefficient
Suppose that
2
2
(1
T h ,2
T h ,1,2 )
c
* 2
2
2
E[(eT h ( w )) ] T h ,1 2
T h ,1
T h,1 T2h,2 2T h,1,2 T h,1 T h,2
Result:
c
T h
2
M
M
yt h ) E wT , h ,i biasT ,h ,i y wT ,h ,i xt ,h ,i E ( xt ,h ,i )
i
i
2
2
T , h ,i
2
T , h ,i
bias
wT2 ,h ,iVarT2.h.i
2
y
T+1
Time
Module 9
Session 2, Part 2: Implementation
Issues
If T,h,1,2 > 0 and 2T,h,2 < T,h,1,2 < 2T,h,1 then w* < 0
et,h,2
T
Module 9
Session 3: Methods to estimate the
weights when M is low relative to T
t 1, 2,...T - h
s.t. ,i 1
i 1
subject to uw = 1 and
Problem 2: Choose w to minimize w'w
wi 0, where
T h
e
t 1
t,h
Module 9
Session 4: Methods to estimate the
weights when M is high relative to T
Relative Performance
Shrinking Relative Performance
Recent Performance
Adaptive Weights
Non-parametric (trimming and indexing)
T h 1 t 1
1
MSET ,h ,i
M
1
i 1 MSET , h ,i
T , h ,i
MSE
T , h ,i
k
M
i 1 MSET , h ,i
T h
1
2
t , h ,i (t )
#period with 0 t 1
(t )
T h t
rolling
window
discounted
MSE
Adaptive weights
Relative performance weights could be sensitive to adding new
forecast errors. A possibility is to adapt previous weights by the most
recently computed weights
1 Ri
M
1 R
j 1
Module 9
Session 5: Workshop on Combining
Forecasts
Combining Forecasts
Step One: Estimate each of the models using LS and Forecast
2008-09 using EViews. Note the RMSE of each.
Step Two: Calculate a combined forecast using the misspecified
ones using:
Equal Weights
Trimmed Weights
Inverse MSE weights
Combining Forecasts
Step Three: Compare the RMSE of the combined forecast
models to that of the individual forecast models.
Which is most accurate?
Do all 3 combined ones outperform the individual ones?
Module 9
Session 6 : Forecast Combination
Tools in EViews
Module 9
Session 7: Conclusions
Conclusions
Numerous weighting schemes have been proposed to
formulate combined forecasts.
Simple combination schemes are difficult to beat; why this is
the case is not fully understood.
Simple weights reduce variability with relatively little cost in terms of
overall bias
Also provide diversity if pool of models is indeed diverse.
Conclusions
Results are valid for symmetric loss function; may not be valid if sign of the
error matters
Forecasts based solely on the model with the best in-sample performance
often yields poor out-of-sample forecasting performance.
Reflects the reasonable prior that a preferred model is really just an
approximation of true DGP, which can change each period.
Combined forecasts imply diversification of risk (provided not all the
models suffer from the same misspecification problem).
Appendix
JVI14.09
65
Appendix 1
Let e be the (M x 1) vector of the forecast errors. Problem 1:
choose the vector w to minimize E[weew] subject to uw = 1.
Notice that E[weew]
= wE[ee]w = ww. The Lagrangean is
L w'ee'w - [u'w - 1]
and the FOC is
w - u 0 w* = -1u
-1
-1
-1
w = u
u' u
JVI14.09
-1
66
Appendix 1
Let t,h be the variance-covariance matrix of the forecasting errors
T , h
T2 h ,1
T h ,1,2
T h ,1,2
T2 h ,2
det | T , h
T2 h ,2
|
T h ,1,2
T h ,1,2
T2 h ,1
Let u = [1, 1]. The two weights w* and (1 - w*) can be written as
T,h -1u
1 w
u' -1u
T,h
*
JVI14.09
67
Appendix 2
Notice that
and that
68
Appendix 3
The MSE loss function of a forecast has two components:
the squared bias of the forecast
the (ex-ante) forecast variance
JVI14.09
69
Appendix 4
Suppose that x Py where P is an (m x T) matrix, y is a (T x 1)
vector with all yt , t = 1,T. Consider:
T , h ,i
2
T , h ,i
2
1 T h
xt , h ,i yt h
T h t 1
2
1 T h
E
[
y
]
t , h ,i
t h
y ,t h
T h t 1
2
y
2
1 T h
2 T h
y ,t h xt ,h ,i E[ yt h ]
xt ,h,i E[ yt h ] T h
T h t 1
t 1
JVI14.09
70
Appendix 4
Consider:
2
T , h ,i
2
1 T h
2 T h
xt , h ,i E[ yt h ]
y ,t h xt ,h ,i E[ yt h ]
T h t 1
T h t 1
2
...
'(Py - E[y])
T h
2
...
'(PE[y] + P - E[y])
T h
2
...
'P '(I - P)E[y]
T h
2
MSPET
E 'P
T h
2
y
JVI14.09
71