Iterative Trace Minimization for the Reconciliation of Very Short Hierarchical Time Series
Louis Steinmeister, Markus Pauly

TL;DR
This paper introduces an iterative trace minimization method to improve hierarchical time series reconciliation, especially for very short series, by reducing parameter estimation and enhancing forecast accuracy.
Contribution
It proposes a novel iterative approach that enhances MinT's performance for short time series and large hierarchies, addressing covariance estimation challenges.
Findings
Improved forecast accuracy for very short time series.
Reduced number of parameters needed for covariance estimation.
Demonstrated effectiveness on semiconductor market data.
Abstract
Time series often appear in an additive hierarchical structure. In such cases, time series on higher levels are the sums of their subordinate time series. This hierarchical structure places a natural constraint on forecasts. However, univariate forecasting techniques are incapable of ensuring this forecast coherence. An obvious solution is to forecast only bottom time series and obtain higher level forecasts through aggregation. This approach is also known as the bottom-up approach. In their seminal paper, \citep{Wickramasuriya2019} propose an optimal reconciliation approach named MinT. It tries to minimize the trace of the underlying covariance matrix of all forecast errors. The MinT algorithm has demonstrated superior performance to the bottom-up and other approaches and enjoys great popularity. This paper provides a simulation study examining the performance of MinT for very short…
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 · Neural Networks and Applications
