HierarchicalForecast package provides the most comprehensive
collection of Python implementations of hierarchical forecasting
algorithms that follow classic hierarchical reconciliation. All the
methods have a reconcile function capable of reconciling base
forecasts using numpy arrays.
Cross-sectional hierarchies
Traditionally, hierarchical forecasting methods reconcile cross-sectional aggregations. For example, we may have forecasts for individual product demand, but also for the overall product group, department and store, and we are interested in making sure these forecasts are coherent with each other. This can be formalized as: where denotes the matrix of forecasts for all time series for all time steps in the hierarchy, is a matrix that defines the hierarchical relationship between the bottom-level time series and the aggregations, is a matrix that encapsulates the contribution of each forecast to the final estimate, and is the matrix of reconciled forecasts. We can use the matrix to define various forecast contribution scenarios. Cross-sectional reconciliation methods aim to find the optimal matrix.Temporal hierarchies
We can also perform temporal reconciliation. For example, we may have forecasts for daily demand, weekly, and monthly, and we are interested in making sure these forecasts are coherent with each other. We formalize the temporal hierarchical forecasting problem as: where is a matrix that defines the hierarchical relationship between the bottom-level time steps and the aggregations and is a matrix that encapsulates the contribution of each forecast to the final estimate. We can use the matrix to define various forecast contribution scenarios. Temporal reconciliation methods aim to find the optimal matrix.Cross-temporal reconciliation
We can combine cross-sectional and temporal hierarchical forecasting by performing cross-sectional reconciliation and temporal reconciliation in a two-step procedure.References
-Hyndman, Rob. Notation for forecast reconciliation.1. Bottom-Up
BottomUp
HReconciler
Bottom Up Reconciliation Class.
The most basic hierarchical reconciliation is performed using an Bottom-Up strategy. It was proposed for
the first time by Orcutt in 1968.
The corresponding hierarchical βprojectionβ matrix is defined as:
References:
BottomUp.fit
Returns:
BottomUp.predict
Returns:
BottomUp.fit_predict
Returns:
BottomUp.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
BottomUpSparse
BottomUp
BottomUpSparse Reconciliation Class.
This is the implementation of a Bottom Up reconciliation using the sparse
matrix approach. It works much more efficient on datasets with many time series.
[makoren: At least I hope so, I only checked up until ~20k time series, and
thereβs no real improvement, it would be great to check for smth like 1M time
series, where the dense S matrix really stops fitting in memory]
See the parent class for more details.
BottomUpSparse.fit
Returns:
BottomUpSparse.predict
Returns:
BottomUpSparse.fit_predict
Returns:
BottomUpSparse.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
2. Top-Down
TopDown
HReconciler
Top Down Reconciliation Class.
The Top Down hierarchical reconciliation method, distributes the total aggregate predictions and decomposes
it down the hierarchy using proportions that can be actual historical values
or estimated.
Parameters:
References:
- CW. Gross (1990). βDisaggregation methods to expedite product line forecastingβ. Journal of Forecasting, 9 , 233-254. doi:10.1002/for.3980090304.
- G. Fliedner (1999). βAn investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlationβ. Computers and Operations Research, 26 , 1133-1149. doi:10.1016/S0305-0548(99)00017-9.
TopDown.fit
Returns:
TopDown.predict
Returns:
TopDown.fit_predict
Returns:
TopDown.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
TopDownSparse
Bases: TopDown
TopDownSparse Reconciliation Class.
This is an implementation of top-down reconciliation using the sparse matrix
approach. It works much more efficiently on data sets with many time series.
See the parent class for more details.
TopDownSparse.fit
Returns:
TopDownSparse.predict
Returns:
TopDownSparse.fit_predict
TopDownSparse.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
3. Middle-Out
MiddleOut
HReconciler
Middle Out Reconciliation Class.
This method is only available for strictly hierarchical structures. It anchors the base predictions
in a middle level. The levels above the base predictions use the Bottom-Up approach, while the levels
below use a Top-Down.
Parameters:
References:
MiddleOut.fit
MiddleOut.predict
MiddleOut.fit_predict
Returns:
MiddleOut.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
MiddleOutSparse
Bases: MiddleOut
MiddleOutSparse Reconciliation Class.
This is an implementation of middle-out reconciliation using the sparse matrix
approach. It works much more efficiently on data sets with many time series.
See the parent class for more details.
MiddleOutSparse.fit
MiddleOutSparse.predict
MiddleOutSparse.fit_predict
MiddleOutSparse.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
4. Min-Trace
MinTrace
HReconciler
MinTrace Reconciliation Class.
This reconciliation algorithm proposed by Wickramasuriya et al. depends on a generalized least squares estimator
and an estimator of the covariance matrix of the coherency errors . The Min Trace algorithm
minimizes the squared errors for the coherent forecasts under an unbiasedness assumption; the solution has a
closed form.
Parameters:
References:
- Wickramasuriya, S. L., Athanasopoulos, G., & Hyndman, R. J. (2019). βOptimal forecast reconciliation for hierarchical and grouped time series through trace minimizationβ. Journal of the American Statistical Association, 114 , 804-819. doi:10.1080/01621459.2018.1448825..
- Wickramasuriya, S.L., Turlach, B.A. & Hyndman, R.J. (2020). βOptimal non-negative forecast reconciliationβ. Stat Comput 30, 1167-1182. https://doi.org/10.1007/s11222-020-09930-0.
- Wickramasuriya, S.L. (2021). Properties of point forecast reconciliation approaches. arXiv:2103.11129.
- Wang, X., Hyndman, R.J., & Wickramasuriya, S.L. (2025). Optimal forecast reconciliation with time series selection. European Journal of Operational Research, 323, 455-470.
MinTrace.fit
Returns:
MinTrace.predict
Returns:
MinTrace.fit_predict
Returns:
MinTrace.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
MinTraceSparse
MinTrace
MinTraceSparse Reconciliation Class.
This is the implementation of OLS and WLS estimators using sparse matrices. It is not guaranteed
to give identical results to the non-sparse version, but works much more efficiently on data sets
with many time series.
See the parent class for more details.
Parameters:
MinTraceSparse.fit
Returns:
MinTraceSparse.predict
Returns:
MinTraceSparse.fit_predict
Returns:
MinTraceSparse.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
5. Optimal Combination
OptimalCombination
MinTrace
Optimal Combination Reconciliation Class.
This reconciliation algorithm was proposed by Hyndman et al. 2011, the method uses generalized least squares
estimator using the coherency errors covariance matrix. Consider the covariance of the base forecast
, the matrix of this method is defined by:
where denotes the variance pseudo-inverse. The method was later proven equivalent to
MinTrace variants.
Parameters:
OptimalCombination.fit
Returns:
OptimalCombination.predict
Returns:
OptimalCombination.fit_predict
Returns:
OptimalCombination.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
6. Emp. Risk Minimization
ERM
HReconciler
Empirical Risk Minimization Reconciliation Class.
The Empirical Risk Minimization reconciliation strategy relaxes the unbiasedness assumptions from
previous reconciliation methods like MinT and optimizes square errors between the reconciled predictions
and the validation data to obtain an optimal reconciliation matrix P.
The exact solution for (method='closed') follows the expression:
The alternative Lasso regularized solution (method='reg_bu') is useful when the observations
of validation data is limited or the exact solution has low numerical stability.
Parameters:
ERM.fit
Returns:
ERM.predict
Returns:
ERM.fit_predict
Returns:
ERM.sample
intervals_method selected during the reconcilerβs
instantiation. Currently available: normality, bootstrap, permbu.
Parameters:
Returns:
References
General Reconciliation
- Orcutt, G.H., Watts, H.W., & Edwards, J.B.(1968). Data aggregation and information loss. The American Economic Review, 58 , 773(787).
- Disaggregation methods to expedite product line forecasting. Journal of Forecasting, 9 , 233β254. doi:10.1002/for.3980090304.
- An investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlation. Computers and Operations Research, 26 , 1133β1149. doi:10.1016/S0305-0548(99)00017-9.
- Hyndman, R.J., & Athanasopoulos, G. (2021). βForecasting: principles and practice, 3rd edition: Chapter 11: Forecasting hierarchical and grouped series.β. OTexts: Melbourne, Australia. OTexts.com/fpp3 Accessed on July 2022.
- Rob J. Hyndman, Roman A. Ahmed, George Athanasopoulos, Han Lin Shang. βOptimal Combination Forecasts for Hierarchical Time Seriesβ (2010).
- Shanika L. Wickramasuriya, George Athanasopoulos and Rob J. Hyndman. βOptimal Combination Forecasts for Hierarchical Time Seriesβ (2010).
- Ben Taieb, S., & Koo, B. (2019). Regularized regression for hierarchical forecasting without unbiasedness conditions. In Proceedings of the 25th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining KDD β19 (p.Β 1337-1347). New York, NY, USA: Association for Computing Machinery.
Hierarchical Probabilistic Coherent Predictions
- Puwasala Gamakumara Ph. D. dissertation. Monash University, Econometrics and Business Statistics. βProbabilistic Forecast Reconciliationβ.
- Taieb, Souhaib Ben and Taylor, James W and Hyndman, Rob J. (2017). Coherent probabilistic forecasts for hierarchical time series. International conference on machine learning ICML.

