reconcilia on 3 Fast computa onal tricks 4 Temporal hierarchies 5 Probabilis c reconcilia on 6 References Op mal Forecast Reconcilia on Hierarchical and grouped me series 2
Classifica on of Occupa ons 8 major groups 43 sub-major groups 97 minor groups – 359 unit groups * 1023 occupa ons Example: Sta s cian 2 Professionals 22 Business, Human Resource and Marke ng Professionals 224 Informa on and Organisa on Professionals 2241 Actuaries, Mathema cians and Sta s cians 224113 Sta s cian Op mal Forecast Reconcilia on Hierarchical and grouped me series 3
Classifica on of Occupa ons 8 major groups 43 sub-major groups 97 minor groups – 359 unit groups * 1023 occupa ons Example: Sta s cian 2 Professionals 22 Business, Human Resource and Marke ng Professionals 224 Informa on and Organisa on Professionals 2241 Actuaries, Mathema cians and Sta s cians 224113 Sta s cian Op mal Forecast Reconcilia on Hierarchical and grouped me series 3
grouped me series 4 Quarterly data on visitor night from 1998:Q1 – 2013:Q4 From Na onal Visitor Survey, based on annual interviews of 120,000 Australians aged 15+, collected by Tourism Research Australia. Split by 7 states, 27 zones and 76 regions (a geographical hierarchy) Also split by purpose of travel Holiday Visi ng friends and rela ves (VFR) Business Other 304 bo om-level series
me series 5 Monthly UK sales data from 2000 – 2014 Provided by a large spectacle manufacturer Split by brand (26), gender (3), price range (6), materials (4), and stores (600) About 1 million bo om-level series
me series 5 Monthly UK sales data from 2000 – 2014 Provided by a large spectacle manufacturer Split by brand (26), gender (3), price range (6), materials (4), and stores (600) About 1 million bo om-level series
me series 5 Monthly UK sales data from 2000 – 2014 Provided by a large spectacle manufacturer Split by brand (26), gender (3), price range (6), materials (4), and stores (600) About 1 million bo om-level series
me series 5 Monthly UK sales data from 2000 – 2014 Provided by a large spectacle manufacturer Split by brand (26), gender (3), price range (6), materials (4), and stores (600) About 1 million bo om-level series
on of several me series that are linked together in a hierarchical structure. Total A AA AB AC B BA BB BC C CA CB CC Examples Labour turnover by occupa on Tourism by state and region Op mal Forecast Reconcilia on Hierarchical and grouped me series 6
on of several me series that are linked together in a hierarchical structure. Total A AA AB AC B BA BB BC C CA CB CC Examples Labour turnover by occupa on Tourism by state and region Op mal Forecast Reconcilia on Hierarchical and grouped me series 6
on of several me series that are linked together in a hierarchical structure. Total A AA AB AC B BA BB BC C CA CB CC Examples Labour turnover by occupa on Tourism by state and region Op mal Forecast Reconcilia on Hierarchical and grouped me series 6
on of me series that can be grouped together in a number of non-hierarchical ways. Total A AX AY B BX BY Total X AX BX Y AY BY Examples Labour turnover by occupa on and state Tourism by region and purpose of travel Spectacle sales by brand, gender, stores, etc. Op mal Forecast Reconcilia on Hierarchical and grouped me series 7
on of me series that can be grouped together in a number of non-hierarchical ways. Total A AX AY B BX BY Total X AX BX Y AY BY Examples Labour turnover by occupa on and state Tourism by region and purpose of travel Spectacle sales by brand, gender, stores, etc. Op mal Forecast Reconcilia on Hierarchical and grouped me series 7
on of me series that can be grouped together in a number of non-hierarchical ways. Total A AX AY B BX BY Total X AX BX Y AY BY Examples Labour turnover by occupa on and state Tourism by region and purpose of travel Spectacle sales by brand, gender, stores, etc. Op mal Forecast Reconcilia on Hierarchical and grouped me series 7
on of me series that can be grouped together in a number of non-hierarchical ways. Total A AX AY B BX BY Total X AX BX Y AY BY Examples Labour turnover by occupa on and state Tourism by region and purpose of travel Spectacle sales by brand, gender, stores, etc. Op mal Forecast Reconcilia on Hierarchical and grouped me series 7
on using an automa c forecas ng algorithm (e.g., ets, auto.arima, ...) 2 Reconcile the resul ng forecasts so they add up correctly using least squares op miza on (i.e., find closest reconciled forecasts to the original forecasts). 3 This is all available in the hts package in R. Op mal Forecast Reconcilia on Hierarchical and grouped me series 8
on using an automa c forecas ng algorithm (e.g., ets, auto.arima, ...) 2 Reconcile the resul ng forecasts so they add up correctly using least squares op miza on (i.e., find closest reconciled forecasts to the original forecasts). 3 This is all available in the hts package in R. Op mal Forecast Reconcilia on Hierarchical and grouped me series 8
on using an automa c forecas ng algorithm (e.g., ets, auto.arima, ...) 2 Reconcile the resul ng forecasts so they add up correctly using least squares op miza on (i.e., find closest reconciled forecasts to the original forecasts). 3 This is all available in the hts package in R. Op mal Forecast Reconcilia on Hierarchical and grouped me series 8
Reconcilia on Hierarchical and grouped me series 9 yt : observed aggregate of all series at me t. yX,t : observa on on series X at me t. bt : vector of all series at bo om level in me t.
Reconcilia on Hierarchical and grouped me series 9 yt : observed aggregate of all series at me t. yX,t : observa on on series X at me t. bt : vector of all series at bo om level in me t.
, yA,t , yB,t , yC,t ] = 1 1 1 1 0 0 0 1 0 0 0 1 yA,t yB,t yC,t Op mal Forecast Reconcilia on Hierarchical and grouped me series 9 yt : observed aggregate of all series at me t. yX,t : observa on on series X at me t. bt : vector of all series at bo om level in me t.
, yA,t , yB,t , yC,t ] = 1 1 1 1 0 0 0 1 0 0 0 1 S yA,t yB,t yC,t Op mal Forecast Reconcilia on Hierarchical and grouped me series 9 yt : observed aggregate of all series at me t. yX,t : observa on on series X at me t. bt : vector of all series at bo om level in me t.
, yA,t , yB,t , yC,t ] = 1 1 1 1 0 0 0 1 0 0 0 1 S yA,t yB,t yC,t bt Op mal Forecast Reconcilia on Hierarchical and grouped me series 9 yt : observed aggregate of all series at me t. yX,t : observa on on series X at me t. bt : vector of all series at bo om level in me t.
, yA,t , yB,t , yC,t ] = 1 1 1 1 0 0 0 1 0 0 0 1 S yA,t yB,t yC,t bt yt = Sbt Op mal Forecast Reconcilia on Hierarchical and grouped me series 9 yt : observed aggregate of all series at me t. yX,t : observa on on series X at me t. bt : vector of all series at bo om level in me t.
series with aggrega on constraints can be wri en as yt = Sbt where yt is a vector of all series at me t bt is a vector of the most disaggregated series at me t S is a “summing matrix” containing the aggrega on constraints. Op mal Forecast Reconcilia on Hierarchical and grouped me series 12
reconcilia on 3 Fast computa onal tricks 4 Temporal hierarchies 5 Probabilis c reconcilia on 6 References Op mal Forecast Reconcilia on Minimum trace reconcilia on 13
of ini al h-step forecasts, made at me n, stacked in same order as yt. (In general, they will not “add up”.) Reconciled forecasts must be of the form: ˜ yn (h) = SPˆ yn (h) for some matrix P. P extracts and combines base forecasts ˆ yn (h) to get bo om-level forecasts. S adds them up Op mal Forecast Reconcilia on Minimum trace reconcilia on 14
of ini al h-step forecasts, made at me n, stacked in same order as yt. (In general, they will not “add up”.) Reconciled forecasts must be of the form: ˜ yn (h) = SPˆ yn (h) for some matrix P. P extracts and combines base forecasts ˆ yn (h) to get bo om-level forecasts. S adds them up Op mal Forecast Reconcilia on Minimum trace reconcilia on 14
of ini al h-step forecasts, made at me n, stacked in same order as yt. (In general, they will not “add up”.) Reconciled forecasts must be of the form: ˜ yn (h) = SPˆ yn (h) for some matrix P. P extracts and combines base forecasts ˆ yn (h) to get bo om-level forecasts. S adds them up Op mal Forecast Reconcilia on Minimum trace reconcilia on 14
of ini al h-step forecasts, made at me n, stacked in same order as yt. (In general, they will not “add up”.) Reconciled forecasts must be of the form: ˜ yn (h) = SPˆ yn (h) for some matrix P. P extracts and combines base forecasts ˆ yn (h) to get bo om-level forecasts. S adds them up Op mal Forecast Reconcilia on Minimum trace reconcilia on 14
of ini al h-step forecasts, made at me n, stacked in same order as yt. (In general, they will not “add up”.) Reconciled forecasts must be of the form: ˜ yn (h) = SPˆ yn (h) for some matrix P. P extracts and combines base forecasts ˆ yn (h) to get bo om-level forecasts. S adds them up Op mal Forecast Reconcilia on Minimum trace reconcilia on 14
SPˆ yn (h) Bias Reconciled forecasts are unbiased iff SPS = S. Variance Let error variance of h-step base forecasts ˆ yn (h) be Wh = Var[yn+h − ˆ yn (h) | y1 , . . . , yn ] Then the error variance of the corresponding reconciled forecasts is Var[yn+h − ˜ yn (h) | y1 , . . . , yn ] = SPWh P S Op mal Forecast Reconcilia on Minimum trace reconcilia on 15
SPˆ yn (h) Bias Reconciled forecasts are unbiased iff SPS = S. Variance Let error variance of h-step base forecasts ˆ yn (h) be Wh = Var[yn+h − ˆ yn (h) | y1 , . . . , yn ] Then the error variance of the corresponding reconciled forecasts is Var[yn+h − ˜ yn (h) | y1 , . . . , yn ] = SPWh P S Op mal Forecast Reconcilia on Minimum trace reconcilia on 15
SPˆ yn (h) Bias Reconciled forecasts are unbiased iff SPS = S. Variance Let error variance of h-step base forecasts ˆ yn (h) be Wh = Var[yn+h − ˆ yn (h) | y1 , . . . , yn ] Then the error variance of the corresponding reconciled forecasts is Var[yn+h − ˜ yn (h) | y1 , . . . , yn ] = SPWh P S Op mal Forecast Reconcilia on Minimum trace reconcilia on 15
yn (h) Theorem: MinT Reconcilia on If P sa sfies SPS = S, then minP = trace[SPWh P S ] has solu on P = (S W−1 h S)−1S W−1 h . Reconciled forecasts Base forecasts Assume that Wh = kh W1 to simplify computa ons. Op mal Forecast Reconcilia on Minimum trace reconcilia on 16 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
yn (h) Theorem: MinT Reconcilia on If P sa sfies SPS = S, then minP = trace[SPWh P S ] has solu on P = (S W−1 h S)−1S W−1 h . Reconciled forecasts Base forecasts Assume that Wh = kh W1 to simplify computa ons. Op mal Forecast Reconcilia on Minimum trace reconcilia on 16 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
yn (h) Theorem: MinT Reconcilia on If P sa sfies SPS = S, then minP = trace[SPWh P S ] has solu on P = (S W−1 h S)−1S W−1 h . Reconciled forecasts Base forecasts Assume that Wh = kh W1 to simplify computa ons. Op mal Forecast Reconcilia on Minimum trace reconcilia on 16 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
yn (h) Theorem: MinT Reconcilia on If P sa sfies SPS = S, then minP = trace[SPWh P S ] has solu on P = (S W−1 h S)−1S W−1 h . Reconciled forecasts Base forecasts Assume that Wh = kh W1 to simplify computa ons. Op mal Forecast Reconcilia on Minimum trace reconcilia on 16 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 1: OLS Assume W1 ≈ kI. ˜ yn (h) = S(S S)−1S ˆ yn (h) Reconcilia on does not depend on data Works surprisingly well. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 17 ˜ yn (h) = S(S W−1 1 S)−1S W−1 1 ˆ yn (h)
on 1: OLS Assume W1 ≈ kI. ˜ yn (h) = S(S S)−1S ˆ yn (h) Reconcilia on does not depend on data Works surprisingly well. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 17 ˜ yn (h) = S(S W−1 1 S)−1S W−1 1 ˆ yn (h)
on 1: OLS Assume W1 ≈ kI. ˜ yn (h) = S(S S)−1S ˆ yn (h) Reconcilia on does not depend on data Works surprisingly well. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 17 ˜ yn (h) = S(S W−1 1 S)−1S W−1 1 ˆ yn (h)
on 1: OLS Assume W1 ≈ kI. ˜ yn (h) = S(S S)−1S ˆ yn (h) Reconcilia on does not depend on data Works surprisingly well. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 17 ˜ yn (h) = S(S W−1 1 S)−1S W−1 1 ˆ yn (h)
on 1: OLS Assume W1 ≈ kI. ˜ yn (h) = S(S S)−1S ˆ yn (h) Reconcilia on does not depend on data Works surprisingly well. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 17 ˜ yn (h) = S(S W−1 1 S)−1S W−1 1 ˆ yn (h)
on 1: OLS Assume W1 ≈ kI. ˜ yn (h) = S(S S)−1S ˆ yn (h) Reconcilia on does not depend on data Works surprisingly well. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 17 ˜ yn (h) = S(S W−1 1 S)−1S W−1 1 ˆ yn (h)
on 2: WLS Approximate W1 by its diagonal. Easy to es mate, and places weight where we have best forecasts. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 18 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 2: WLS Approximate W1 by its diagonal. Easy to es mate, and places weight where we have best forecasts. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 18 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 2: WLS Approximate W1 by its diagonal. Easy to es mate, and places weight where we have best forecasts. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 18 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 2: WLS Approximate W1 by its diagonal. Easy to es mate, and places weight where we have best forecasts. S ll need to es mate covariance matrix to produce predic on intervals. Op mal Forecast Reconcilia on Minimum trace reconcilia on 18 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 3: GLS Es mate W1 using shrinkage to the diagonal. Allows for covariances. Difficult to compute for large numbers of me series. Op mal Forecast Reconcilia on Minimum trace reconcilia on 19 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 3: GLS Es mate W1 using shrinkage to the diagonal. Allows for covariances. Difficult to compute for large numbers of me series. Op mal Forecast Reconcilia on Minimum trace reconcilia on 19 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 3: GLS Es mate W1 using shrinkage to the diagonal. Allows for covariances. Difficult to compute for large numbers of me series. Op mal Forecast Reconcilia on Minimum trace reconcilia on 19 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
on 3: GLS Es mate W1 using shrinkage to the diagonal. Allows for covariances. Difficult to compute for large numbers of me series. Op mal Forecast Reconcilia on Minimum trace reconcilia on 19 ˜ yn (h) = S(S W−1 h S)−1S W−1 h ˆ yn (h)
reconcilia on 3 Fast computa onal tricks 4 Temporal hierarchies 5 Probabilis c reconcilia on 6 References Op mal Forecast Reconcilia on Fast computa onal tricks 24
tree of trees: Total T1 T2 ... TK Then the summing matrix contains k smaller summing matrices: S = 1n1 1n2 · · · 1nK S1 0 · · · 0 0 S2 · · · 0 . . . . . . ... . . . 0 0 · · · SK where 1n is an n-vector of ones and tree Ti has ni terminal nodes. Op mal Forecast Reconcilia on Fast computa onal tricks 27
tree of trees: Total T1 T2 ... TK Then the summing matrix contains k smaller summing matrices: S = 1n1 1n2 · · · 1nK S1 0 · · · 0 0 S2 · · · 0 . . . . . . ... . . . 0 0 · · · SK where 1n is an n-vector of ones and tree Ti has ni terminal nodes. Op mal Forecast Reconcilia on Fast computa onal tricks 27
S1 Λ1 S1 0 · · · 0 0 S2 Λ2 S2 · · · 0 . . . . . . ... . . . 0 0 · · · SK ΛK SK + λ0 Jn λ0 is the top le element of Λ; Λk is a block of Λ, corresponding to tree Tk; Jn is a matrix of ones; n = k nk. Now apply the Sherman-Morrison formula ... Op mal Forecast Reconcilia on Fast computa onal tricks 28
S1 Λ1 S1 0 · · · 0 0 S2 Λ2 S2 · · · 0 . . . . . . ... . . . 0 0 · · · SK ΛK SK + λ0 Jn λ0 is the top le element of Λ; Λk is a block of Λ, corresponding to tree Tk; Jn is a matrix of ones; n = k nk. Now apply the Sherman-Morrison formula ... Op mal Forecast Reconcilia on Fast computa onal tricks 28
(S1 Λ1 S1 )−1 0 · · · 0 0 (S2 Λ2 S2 )−1 · · · 0 . . . . . . ... . . . 0 0 · · · (SK ΛK SK )−1 − cS0 S0 can be par oned into K2 blocks, with the (k, ) block (of dimension nk × n ) being (Sk Λk Sk )−1Jnk ,n (S Λ S )−1 Jnk ,n is a nk × n matrix of ones. c−1 = λ−1 0 + k 1nk (Sk Λk Sk )−11nk . Each Sk Λk Sk can be inverted similarly. S Λy can also be computed recursively. Op mal Forecast Reconcilia on Fast computa onal tricks 29
(S1 Λ1 S1 )−1 0 · · · 0 0 (S2 Λ2 S2 )−1 · · · 0 . . . . . . ... . . . 0 0 · · · (SK ΛK SK )−1 − cS0 S0 can be par oned into K2 blocks, with the (k, ) block (of dimension nk × n ) being (Sk Λk Sk )−1Jnk ,n (S Λ S )−1 Jnk ,n is a nk × n matrix of ones. c−1 = λ−1 0 + k 1nk (Sk Λk Sk )−11nk . Each Sk Λk Sk can be inverted similarly. S Λy can also be computed recursively. Op mal Forecast Reconcilia on Fast computa onal tricks 29 The recursive calcula ons can be done in such a way that we never store any of the large matrices involved.
grouped me series with two groups. When the me series are not strictly hierarchical and have more than two grouping variables: Use sparse matrix storage and arithme c. Use itera ve approxima on for inver ng large sparse matrices. Paige & Saunders (1982) ACM Trans. Math. So ware Op mal Forecast Reconcilia on Fast computa onal tricks 30
grouped me series with two groups. When the me series are not strictly hierarchical and have more than two grouping variables: Use sparse matrix storage and arithme c. Use itera ve approxima on for inver ng large sparse matrices. Paige & Saunders (1982) ACM Trans. Math. So ware Op mal Forecast Reconcilia on Fast computa onal tricks 30
grouped me series with two groups. When the me series are not strictly hierarchical and have more than two grouping variables: Use sparse matrix storage and arithme c. Use itera ve approxima on for inver ng large sparse matrices. Paige & Saunders (1982) ACM Trans. Math. So ware Op mal Forecast Reconcilia on Fast computa onal tricks 30
reconcilia on 3 Fast computa onal tricks 4 Temporal hierarchies 5 Probabilis c reconcilia on 6 References Op mal Forecast Reconcilia on Temporal hierarchies 31
idea: ¯ Forecast series at each available frequency. ¯ Op mally reconcile forecasts within the same year. Op mal Forecast Reconcilia on Temporal hierarchies 32
idea: ¯ Forecast series at each available frequency. ¯ Op mally reconcile forecasts within the same year. Op mal Forecast Reconcilia on Temporal hierarchies 32
. , yT, observed at frequency m, we generate aggregate series y[k] j = jk t=1+(j−1)k yt , for j = 1, . . . , T/k k ∈ F(m) = {factors of m}. A single unique hierarchy is only possible when there are no coprime pairs in F(m). Mk = m/k is seasonal period of aggregated series. Op mal Forecast Reconcilia on Temporal hierarchies 35
. , yT, observed at frequency m, we generate aggregate series y[k] j = jk t=1+(j−1)k yt , for j = 1, . . . , T/k k ∈ F(m) = {factors of m}. A single unique hierarchy is only possible when there are no coprime pairs in F(m). Mk = m/k is seasonal period of aggregated series. Op mal Forecast Reconcilia on Temporal hierarchies 35
. , yT, observed at frequency m, we generate aggregate series y[k] j = jk t=1+(j−1)k yt , for j = 1, . . . , T/k k ∈ F(m) = {factors of m}. A single unique hierarchy is only possible when there are no coprime pairs in F(m). Mk = m/k is seasonal period of aggregated series. Op mal Forecast Reconcilia on Temporal hierarchies 35
ΛV: elements equal within aggrega on level. Structural scaling ΛS = diag(S1): elements equal to # nodes at each level. Depends only on seasonal period m. Independent of data and model. Allows forecasts where no errors available. Quarterly example ΛH = diag ˆ σ2 A , ˆ σ2 S1 , ˆ σ2 S2 , ˆ σ2 Q1 , ˆ σ2 Q2 , ˆ σ2 Q3 , ˆ σ2 Q4 ΛV = diag ˆ σ2 A , ˆ σ2 S , ˆ σ2 S , ˆ σ2 Q , ˆ σ2 Q , ˆ σ2 Q , ˆ σ2 Q ΛS = diag 4, 2, 2, 1, 1, 1, 1 Op mal Forecast Reconcilia on Temporal hierarchies 36
ΛV: elements equal within aggrega on level. Structural scaling ΛS = diag(S1): elements equal to # nodes at each level. Depends only on seasonal period m. Independent of data and model. Allows forecasts where no errors available. Quarterly example ΛH = diag ˆ σ2 A , ˆ σ2 S1 , ˆ σ2 S2 , ˆ σ2 Q1 , ˆ σ2 Q2 , ˆ σ2 Q3 , ˆ σ2 Q4 ΛV = diag ˆ σ2 A , ˆ σ2 S , ˆ σ2 S , ˆ σ2 Q , ˆ σ2 Q , ˆ σ2 Q , ˆ σ2 Q ΛS = diag 4, 2, 2, 1, 1, 1, 1 Op mal Forecast Reconcilia on Temporal hierarchies 36
ΛV: elements equal within aggrega on level. Structural scaling ΛS = diag(S1): elements equal to # nodes at each level. Depends only on seasonal period m. Independent of data and model. Allows forecasts where no errors available. Quarterly example ΛH = diag ˆ σ2 A , ˆ σ2 S1 , ˆ σ2 S2 , ˆ σ2 Q1 , ˆ σ2 Q2 , ˆ σ2 Q3 , ˆ σ2 Q4 ΛV = diag ˆ σ2 A , ˆ σ2 S , ˆ σ2 S , ˆ σ2 Q , ˆ σ2 Q , ˆ σ2 Q , ˆ σ2 Q ΛS = diag 4, 2, 2, 1, 1, 1, 1 Op mal Forecast Reconcilia on Temporal hierarchies 36
Major A&E 2 Type 2 Departments — Single Specialty 3 Type 3 Departments — Other A&E/Minor Injury 4 Total A endances 5 Type 1 Departments — Major A&E > 4 hrs 6 Type 2 Departments — Single Specialty > 4 hrs 7 Type 3 Departments — Other A&E/Minor Injury > 4 hrs 8 Total A endances > 4 hrs 9 Emergency Admissions via Type 1 A&E 10 Total Emergency Admissions via A&E 11 Other Emergency Admissions (i.e., not via A&E) 12 Total Emergency Admissions 13 Number of pa ents spending > 4 hrs from decision to admission Op mal Forecast Reconcilia on Temporal hierarchies 38
except the last year Base forecasts using auto.arima(). Reconciled using WLSV. Mean Absolute Scaled Errors for 1, 4 and 13 weeks ahead using a rolling origin. Aggr. Level h Base Reconciled Change Weekly 1 1.6 1.3 −17.2% Weekly 4 1.9 1.5 −18.6% Weekly 13 2.3 1.9 −16.2% Weekly 1–52 2.0 1.9 −5.0% Annual 1 3.4 1.9 −42.9% Op mal Forecast Reconcilia on Temporal hierarchies 39
except the last year Base forecasts using auto.arima(). Reconciled using WLSV. Mean Absolute Scaled Errors for 1, 4 and 13 weeks ahead using a rolling origin. Aggr. Level h Base Reconciled Change Weekly 1 1.6 1.3 −17.2% Weekly 4 1.9 1.5 −18.6% Weekly 13 2.3 1.9 −16.2% Weekly 1–52 2.0 1.9 −5.0% Annual 1 3.4 1.9 −42.9% Op mal Forecast Reconcilia on Temporal hierarchies 39
except the last year Base forecasts using auto.arima(). Reconciled using WLSV. Mean Absolute Scaled Errors for 1, 4 and 13 weeks ahead using a rolling origin. Aggr. Level h Base Reconciled Change Weekly 1 1.6 1.3 −17.2% Weekly 4 1.9 1.5 −18.6% Weekly 13 2.3 1.9 −16.2% Weekly 1–52 2.0 1.9 −5.0% Annual 1 3.4 1.9 −42.9% Op mal Forecast Reconcilia on Temporal hierarchies 39
except the last year Base forecasts using auto.arima(). Reconciled using WLSV. Mean Absolute Scaled Errors for 1, 4 and 13 weeks ahead using a rolling origin. Aggr. Level h Base Reconciled Change Weekly 1 1.6 1.3 −17.2% Weekly 4 1.9 1.5 −18.6% Weekly 13 2.3 1.9 −16.2% Weekly 1–52 2.0 1.9 −5.0% Annual 1 3.4 1.9 −42.9% Op mal Forecast Reconcilia on Temporal hierarchies 39
except the last year Base forecasts using auto.arima(). Reconciled using WLSV. Mean Absolute Scaled Errors for 1, 4 and 13 weeks ahead using a rolling origin. Aggr. Level h Base Reconciled Change Weekly 1 1.6 1.3 −17.2% Weekly 4 1.9 1.5 −18.6% Weekly 13 2.3 1.9 −16.2% Weekly 1–52 2.0 1.9 −5.0% Annual 1 3.4 1.9 −42.9% Op mal Forecast Reconcilia on Temporal hierarchies 39
except the last year Base forecasts using auto.arima(). Reconciled using WLSV. Mean Absolute Scaled Errors for 1, 4 and 13 weeks ahead using a rolling origin. Aggr. Level h Base Reconciled Change Weekly 1 1.6 1.3 −17.2% Weekly 4 1.9 1.5 −18.6% Weekly 13 2.3 1.9 −16.2% Weekly 1–52 2.0 1.9 −5.0% Annual 1 3.4 1.9 −42.9% Op mal Forecast Reconcilia on Temporal hierarchies 39
2000, IJF). In total 3003 series. 1,428 monthly series with a test sample of 12 observa ons each. 756 quarterly series with a test sample of 8 observa ons each. Forecast each series with ETS models. Op mal Forecast Reconcilia on Temporal hierarchies 40
2000, IJF). In total 3003 series. 1,428 monthly series with a test sample of 12 observa ons each. 756 quarterly series with a test sample of 8 observa ons each. Forecast each series with ETS models. Op mal Forecast Reconcilia on Temporal hierarchies 40
2000, IJF). In total 3003 series. 1,428 monthly series with a test sample of 12 observa ons each. 756 quarterly series with a test sample of 8 observa ons each. Forecast each series with ETS models. Op mal Forecast Reconcilia on Temporal hierarchies 40
2000, IJF). In total 3003 series. 1,428 monthly series with a test sample of 12 observa ons each. 756 quarterly series with a test sample of 8 observa ons each. Forecast each series with ETS models. Op mal Forecast Reconcilia on Temporal hierarchies 40
reconcilia on 3 Fast computa onal tricks 4 Temporal hierarchies 5 Probabilis c reconcilia on 6 References Op mal Forecast Reconcilia on Probabilis c reconcilia on 43
yt is coherent if yt lies in an m-dimensional subspace of Rn spanned by the columns of the summing matrix S. Defini on: Coherent density forecasts Any density p(yt+h ) such that p(yt+h ) = 0 for all yt+h in the null space of S. Coherent point forecasts: ˜ yT+h|T = SPˆ yT+h. Coherent variance forecasts (assuming unbiasedness): ˜ ΣT+h = SPˆ ΣT+h P S Op mal Forecast Reconcilia on Probabilis c reconcilia on 44
yt is coherent if yt lies in an m-dimensional subspace of Rn spanned by the columns of the summing matrix S. Defini on: Coherent density forecasts Any density p(yt+h ) such that p(yt+h ) = 0 for all yt+h in the null space of S. Coherent point forecasts: ˜ yT+h|T = SPˆ yT+h. Coherent variance forecasts (assuming unbiasedness): ˜ ΣT+h = SPˆ ΣT+h P S Op mal Forecast Reconcilia on Probabilis c reconcilia on 44
) Let L be the Energy Score (a proper scoring rule): L(˜ YT+h , yT+h ) = E ˜ YT+h − yT+h α − 1 2 E ˜ YT+h − ˜ YT+h α for α ∈ (0, 2], where ˜ YT+h and ˜ YT+h are independent rvs from N(˜ yT+h|T , ˜ ΣT+h ). There is no closed form expression for L(˜ YT+h , yT+h ) for α ∈ (0, 2) under the Gaussian predic ve distribu on. When α = 2, L(˜ YT+h , yT+h ) = ˜ YT+h − yT+h 2 This is equivalent to MinT solu on. Op mal Forecast Reconcilia on Probabilis c reconcilia on 45
bo om level node using univariate models 2 Compute empirical copulas for each parent+children group. Equivalent to “bo om-up” point forecas ng. No reconcilia on involved. Successfully applied to forecas ng smart-metre electricity demand (Ben Taieb, Taylor, Hyndman, 2017) Op mal Forecast Reconcilia on Probabilis c reconcilia on 46
bo om level node using univariate models 2 Compute empirical copulas for each parent+children group. Equivalent to “bo om-up” point forecas ng. No reconcilia on involved. Successfully applied to forecas ng smart-metre electricity demand (Ben Taieb, Taylor, Hyndman, 2017) Op mal Forecast Reconcilia on Probabilis c reconcilia on 46
(2011). Op mal combina on forecasts for hierarchical me series. Computa onal Sta s cs & Data Analysis 55(9), 2579–2589. RJ Hyndman, A Lee, and E Wang (2016). Fast computa on of reconciled forecasts for hierarchical and grouped me series. Computa onal Sta s cs & Data Analysis 97, 16–32 SL Wickramasuriya, G Athanasopoulos, and RJ Hyndman (2015). Forecas ng hierarchical and grouped me series through trace minimiza on. Working paper. Dept Econometrics & Business Sta s cs, Monash University G Athanasopoulos, RJ Hyndman, N Kourentzes, and F Petropoulos (2017). Forecas ng with temporal hierarchies. European Journal of Opera onal Research 262(1), 60–74 S Ben Taieb, JW Taylor, and RJ Hyndman (2017). Hierarchical Probabilis c Forecas ng of Electricity Demand with Smart Meter Data. Working paper. Dept Econometrics & Business Sta s cs, Monash University RJ Hyndman, A Lee, E Wang, and S Wickramasuriya (2017). hts: Hierarchical and Grouped Time Series. Version 5.1.4. https://CRAN.R-project.org/package=hts RJ Hyndman and N Kourentzes (2016). thief: Temporal Hierarchical Forecas ng. Version 0.2. https://CRAN.R-project.org/package=thief Op mal Forecast Reconcilia on References 48
(2011). Op mal combina on forecasts for hierarchical me series. Computa onal Sta s cs & Data Analysis 55(9), 2579–2589. RJ Hyndman, A Lee, and E Wang (2016). Fast computa on of reconciled forecasts for hierarchical and grouped me series. Computa onal Sta s cs & Data Analysis 97, 16–32 SL Wickramasuriya, G Athanasopoulos, and RJ Hyndman (2015). Forecas ng hierarchical and grouped me series through trace minimiza on. Working paper. Dept Econometrics & Business Sta s cs, Monash University G Athanasopoulos, RJ Hyndman, N Kourentzes, and F Petropoulos (2017). Forecas ng with temporal hierarchies. European Journal of Opera onal Research 262(1), 60–74 S Ben Taieb, JW Taylor, and RJ Hyndman (2017). Hierarchical Probabilis c Forecas ng of Electricity Demand with Smart Meter Data. Working paper. Dept Econometrics & Business Sta s cs, Monash University RJ Hyndman, A Lee, E Wang, and S Wickramasuriya (2017). hts: Hierarchical and Grouped Time Series. Version 5.1.4. https://CRAN.R-project.org/package=hts RJ Hyndman and N Kourentzes (2016). thief: Temporal Hierarchical Forecas ng. Version 0.2. https://CRAN.R-project.org/package=thief Op mal Forecast Reconcilia on References 48 ¯ More informa on: robjhyndman.com