Scaleable Dynamic Forecast Reconciliation
Ross Hollyman, Fotios Petropoulos, Michael E. Tipping

TL;DR
This paper presents a scalable, dynamic probabilistic forecast reconciliation method that adapts weights over time, uses out-of-sample forecasts, and efficiently handles large hierarchical data sets.
Contribution
It introduces a novel dynamic approach that allows time-varying weights, employs out-of-sample forecasts, and decomposes large hierarchies for scalable reconciliation.
Findings
Efficient closed-form covariance estimator for hierarchical data.
Ability to handle large-scale hierarchies by decomposition.
Improved forecast accuracy through dynamic, out-of-sample based weighting.
Abstract
We introduce a dynamic approach to probabilistic forecast reconciliation at scale. Our model differs from the existing literature in this area in several important ways. Firstly we explicitly allow the weights allocated to the base forecasts in forming the combined, reconciled forecasts to vary over time. Secondly we drop the assumption, near ubiquitous in the literature, that in-sample base forecasts are appropriate for determining these weights, and use out of sample forecasts instead. Most existing probabilistic reconciliation approaches rely on time consuming sampling based techniques, and therefore do not scale well (or at all) to large data sets. We address this problem in two main ways, firstly by utilising a closed from estimator of covariance structure appropriate to hierarchical forecasting problems, and secondly by decomposing large hierarchies in to components which can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsTime Series Analysis and Forecasting
