Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation

• URL: http://arxiv.org/abs/2505.03955v1
• Date: Tue, 06 May 2025 20:16:28 GMT
• Title: Hierarchical Forecast Reconciliation on Networks: A Network Flow Optimization Formulation
• Authors: Charupriya Sharma, Iñaki Estella Aguerri, Daniel Guimarans,
• Abstract summary: Reconciliation is crucial for organizations requiring coherent predictions across multiple aggregation levels.<n>Current methods like minimum trace (MinT) are mostly limited to tree structures and are computationally expensive.<n>We introduce FlowRec, which reformulates hierarchical forecast reconciliation as a network flow optimization.
• Score: 2.826553192869411
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Hierarchical forecasting with reconciliation requires forecasting values of a hierarchy (e.g.~customer demand in a state and district), such that forecast values are linked (e.g.~ district forecasts should add up to the state forecast). Basic forecasting provides no guarantee for these desired structural relationships. Reconciliation addresses this problem, which is crucial for organizations requiring coherent predictions across multiple aggregation levels. Current methods like minimum trace (MinT) are mostly limited to tree structures and are computationally expensive. We introduce FlowRec, which reformulates hierarchical forecast reconciliation as a network flow optimization, enabling forecasting on generalized network structures. While reconciliation under the $\ell_0$ norm is NP-hard, we prove polynomial-time solvability for all $\ell_{p > 0}$ norms and , for any strictly convex and continuously differentiable loss function. For sparse networks, FlowRec achieves $O(n^2\log n)$ complexity, significantly improving upon MinT's $O(n^3)$. Furthermore, we prove that FlowRec extends MinT to handle general networks, replacing MinT's error-covariance estimation step with direct network structural information. A key novelty of our approach is its handling of dynamic scenarios: while traditional methods recompute both base forecasts and reconciliation, FlowRec provides efficient localised updates with optimality guarantees. Monotonicity ensures that when forecasts improve incrementally, the initial reconciliation remains optimal. We also establish efficient, error-bounded approximate reconciliation, enabling fast updates in time-critical applications. Experiments on both simulated and real benchmarks demonstrate that FlowRec improves accuracy, runtime by 3-40x and memory usage by 5-7x. These results establish FlowRec as a powerful tool for large-scale hierarchical forecasting applications.

Related papers

• CoIFNet: A Unified Framework for Multivariate Time Series Forecasting with Missing Values [17.25081407284703]
  Collaborative Imputation-Forecasting Network (CoIFNet) is a novel framework that unifies imputation and forecasting.<n>CoIFNet takes the observed values, mask matrix and timestamp embeddings as input, processing them sequentially.<n>We demonstrate the effectiveness and computational efficiency of our proposed approach across diverse missing-data scenarios.
  arXiv  Detail & Related papers  (2025-06-16T03:15:12Z)
• Theoretical Foundation of Flow-Based Time Series Generation: Provable Approximation, Generalization, and Efficiency [7.578147116161996]
  This paper presents the first theoretical framework from the perspective of flow-based generative models.<n>By assuming a general data model, the fitting of the flow-based generative models is confirmed to converge to arbitrary error under the universal approximation of Diffusion Transformer (DiT)
  arXiv  Detail & Related papers  (2025-03-18T09:53:48Z)
• Topology-Aware Conformal Prediction for Stream Networks [54.505880918607296]
  We propose Spatio-Temporal Adaptive Conformal Inference (textttCISTA), a novel framework that integrates network topology and temporal dynamics into the conformal prediction framework.<n>Our results show that textttCISTA effectively balances prediction efficiency and coverage, outperforming existing conformal prediction methods for stream networks.
  arXiv  Detail & Related papers  (2025-03-06T21:21:15Z)
• Optimization Guarantees of Unfolded ISTA and ADMM Networks With Smooth Soft-Thresholding [57.71603937699949]
  We study optimization guarantees, i.e., achieving near-zero training loss with the increase in the number of learning epochs. We show that the threshold on the number of training samples increases with the increase in the network width.
  arXiv  Detail & Related papers  (2023-09-12T13:03:47Z)
• Optimal Training of Mean Variance Estimation Neural Networks [1.4610038284393165]
  This paper focusses on the optimal implementation of a Mean Variance Estimation network (MVE network) (Nix and Weigend, 1994) An MVE network assumes that the data is produced from a normal distribution with a mean function and variance function. We introduce a novel improvement of the MVE network: separate regularization of the mean and the variance estimate.
  arXiv  Detail & Related papers  (2023-02-17T13:44:47Z)
• Efficient probabilistic reconciliation of forecasts for real-valued and count time series [0.840358257755792]
  We propose a new approach based on conditioning to reconcile any type of forecast distribution. We then introduce a new algorithm, called Bottom-Up Sampling, to efficiently sample from the reconciled distribution.
  arXiv  Detail & Related papers  (2022-10-05T14:22:24Z)
• Forecasting Foreign Exchange Rates With Parameter-Free Regression Networks Tuned By Bayesian Optimization [4.642930060629522]
  The article is concerned with the problem of multi-step financial time series forecasting of Foreign Exchange (FX) rates. To address this problem, we introduce a parameter-free regression network termed RegPred Net.
  arXiv  Detail & Related papers  (2022-04-26T13:32:50Z)
• Deep Equilibrium Optical Flow Estimation [80.80992684796566]
  Recent state-of-the-art (SOTA) optical flow models use finite-step recurrent update operations to emulate traditional algorithms. These RNNs impose large computation and memory overheads, and are not directly trained to model such stable estimation. We propose deep equilibrium (DEQ) flow estimators, an approach that directly solves for the flow as the infinite-level fixed point of an implicit layer.
  arXiv  Detail & Related papers  (2022-04-18T17:53:44Z)
• Network Calculus with Flow Prolongation -- A Feedforward FIFO Analysis enabled by ML [73.11023209243326]
  Flow Prolongation (FP) has been shown to improve delay bound accuracy significantly. We introduce DeepFP, an approach to make FP scale by predicting prolongations using machine learning. DeepFP reduces delay bounds by 12.1% on average at negligible additional computational cost.
  arXiv  Detail & Related papers  (2022-02-07T08:46:47Z)
• Manifold Regularized Dynamic Network Pruning [102.24146031250034]
  This paper proposes a new paradigm that dynamically removes redundant filters by embedding the manifold information of all instances into the space of pruned networks. The effectiveness of the proposed method is verified on several benchmarks, which shows better performance in terms of both accuracy and computational cost.
  arXiv  Detail & Related papers  (2021-03-10T03:59:03Z)
• A machine learning approach for forecasting hierarchical time series [4.157415305926584]
  We propose a machine learning approach for forecasting hierarchical time series. Forecast reconciliation is the process of adjusting forecasts to make them coherent across the hierarchy. We exploit the ability of a deep neural network to extract information capturing the structure of the hierarchy.
  arXiv  Detail & Related papers  (2020-05-31T22:26:16Z)
• Network Adjustment: Channel Search Guided by FLOPs Utilization Ratio [101.84651388520584]
  This paper presents a new framework named network adjustment, which considers network accuracy as a function of FLOPs. Experiments on standard image classification datasets and a wide range of base networks demonstrate the effectiveness of our approach.
  arXiv  Detail & Related papers  (2020-04-06T15:51:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.