- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies probabilistic forecasting for hierarchical time series, where every forecast sample must add up correctly across levels (eg store sales summing to regional totals). Existing methods either fix forecasts after training or enforce consistency only for simple distributions like Gaussians, limiting how uncertainty is represented. The authors propose HCFM, a flow-matching generative model that treats forecasting as filling in the future of a trajectory given its observed past. Generation combines a learned component with built-in terms that anchor samples to the observed history and enforce hierarchical consistency. Across multiple benchmarks, HCFM achieves the best probabilistic accuracy.
Critical strengths
-
Hierarchical time series is common in practice. The task is a practically important task. In addition, the small-data setting is realistic, since many organizations have a single hierarchy with limited history, so they cannot rely on large pretrained generative models.
-
No Gaussian or other fixed-family assumption is made, so skewed or multi-modal forecasts can be represented. In addition, the constraint handling does not depend on the network, and it works with both a temporal CNN and a U-Net backbone.
Critical weaknesses
-
The model assumes a fixed hierarchy and a fixed order of series. The U-Net backbone convolves across the series axis, so results may depend on an arbitrary ordering. Adding or removing series means retraining. Would it be possible to perform a simple test, such as shuffling the series order to show how sensitive the results are?
-
PROFHiT models the full-hierarchy distribution with soft consistency regularization, which is very close to the soft-guided idea. It should be discussed and ideally compared. https://faculty.cc.gatech.edu/~badityap/papers/profhit-kdd23.pdf
-
Only CLOVER's setup is described ("reproduced from its paper"). How HierE2E, ProbHardE2E and Hier-Transformer-CNF were configured or tuned is not reported.
Questions for authors
In hierarchical time-series forecasting, is linear sum the only studied aggregation? In real life are there any nonlinear aggregation cases?
2 comments
References:
-
Hyndman, R. J., Ahmed, R. A., Athanasopoulos, G., & Shang, H. L. (2011). Optimal combination forecasts for hierarchical time series. Computational Statistics & Data Analysis, 55(9), 2579–2589. doi:10.1016/j.csda.2011.03.006
-
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(526), 804–819. doi:10.1080/01621459.2018.1448825
-
Athanasopoulos, G., Hyndman, R. J., Kourentzes, N., & Panagiotelis, A. (2024). Forecast reconciliation: A review. International Journal of Forecasting, 40(2), 430–456. doi:10.1016/j.ijforecast.2023.10.010
-
Utkarsh, U., Cai, P., Edelman, A., Gomez-Bombarelli, R., & Rackauckas, C. V. (2025). Physics-constrained flow matching: Sampling generative models with hard constraints. NeurIPS 2025.
-
Utkarsh, U., Maddix, D. C., Ma, R., Mahoney, M. W., & Wang, B. (2026). End-to-end probabilistic framework for learning with hard constraints. ICLR 2026.
-
Shang, H. L., & Hyndman, R. J. (2017). Grouped functional time series forecasting: An application to age-specific mortality rates. Journal of Computational and Graphical Statistics, 26(2), 330–343.
-
Hubrich, K. (2005). Forecasting euro area inflation: Does aggregating forecasts by HICP component improve forecast accuracy? International Journal of Forecasting, 21(1), 119–136.
-
Hyndman, R. J., Booth, H., & Yasmeen, F. (2013). Coherent mortality forecasting: The product-ratio method with functional time series models. Demography, 50(1), 261–283.
-
Bergeron-Boucher, M.-P., Canudas-Romo, V., Oeppen, J., & Vaupel, J. W. (2017). Coherent forecasts of mortality with compositional data analysis. Demographic Research, 37(17), 527–566.
-
Yu, B., Yin, H., and Zhu, Z. (2019). ST-UNet: A Spatio-Temporal U-Network for Graph-structured Time Series Modeling. arXiv:1903.05631. https://arxiv.org/abs/1903.05631
We thank the reviewer for the insightful comments and constructive suggestions. We address each point below.
The U-Net learns cross-series mixing through stacked convolutions and combines temporal resolutions, following the multiscale motivation in [10]. We added an ordering test in Appendix D.7 (Table 3): four orderings on Labour, Tourism-S, Tourism-L, Traffic and Wiki, with separate retraining for each. Permutations are applied consistently to the data, hierarchy operators and evaluation.
Of the 20 ordering means, 19 fall within the corresponding Table 2 mean ± one SD, used only as a descriptive band; the exception is Labour Order 3 (0.0107). All orderings retain lower mean overall sCRPS than CLOVER on Traffic, Wiki and Tourism-L: the worst scores are 0.0280, 0.1939 and 0.1392, versus 0.0419, 0.2753 and 0.1489. This supports robustness across the tested retrained orderings. The model still assumes a fixed hierarchy; node-set changes are outside this test. We believe that a good research direction for the future would be to explore permutation-equivariant residuals, including suitable graph architectures.
We expanded Section 2 to discuss PROFHiT and added the comparison in Appendix I.2. PROFHiT produces conditional Gaussian forecasts through a functional neural process, refines them across nodes, and adds a soft distributional consistency penalty to its variational objective. Its samples don't need to be coherent. HCFM jointly generates all D series over the forecast horizon through a conditional-flow-matching ODE, with trajectory guidance during integration and tangency regularization during training. Final reconciliation ensures sample-wise coherence; projected residuals maintain it throughout integration.
The table reports test sCRPS mean ± SD across three windows after validation selection:
We added implementation and selection details in Appendix D.9, referenced from Section 5.2. HierE2E, ProbHardE2E and PROFHiT use released code and published hyperparameters. For PROFHiT, we fixed numerical errors affecting Labour and Traffic under our protocol; without the fix, scores were 0.2594 ± 0.0106 and 0.1305 ± 0.0078, respectively. CLOVER was re-implemented with its published settings.
Hier-Transformer-CNF/FRT has no public code available. After unsuccessful requests to the authors, we re-implemented its published configuration. Using validation sCRPS, we tuned only the learning rate and encoder, decoder and RealNVP layer counts, following the authors’ sensitivity analysis.
HCFM shares loss weights, guidance-schedule parameterization and sampler across datasets; schedule values are learned. Dataset-specific choices are between two U-Net presets selected by validation sCRPS and MQCNN dilations taken from CLOVER (Appendices D.6–D.7). All methods share CLOVER’s preprocessing and features, the same three windows, and checkpoint selection on validation sCRPS.
Linear aggregation is the standard benchmark setting [1–3], including our six datasets. Fixed weighted sums also cover averages and rates with known weights [6,7]. Log or log-ratio transforms make some multiplicative or compositional relations additive [8,9]. HCFM supports weighted aggregation (Eq. 30); its guarantees concern fixed linear idempotent projections under the assumptions in Appendices A–B.
Nonlinear aggregates include maxima, minima and quantiles. To our knowledge, this setting lacks established benchmarks. ProbHardE2E supports nonlinear constraints [5], although its hierarchical experiments aggregate linearly. Extending HCFM to these cases would require nonlinear constraint enforcement. We now state this scope and limitation in the conclusion.
We hope our responses have clarified your questions, and if so, we would be grateful if you would reconsider your evaluation.