Time-Series Classification for Dynamic Strategies in Multi-Step Forecasting

• URL: http://arxiv.org/abs/2402.08373v1
• Date: Tue, 13 Feb 2024 11:10:14 GMT
• Title: Time-Series Classification for Dynamic Strategies in Multi-Step Forecasting
• Authors: Riku Green, Grant Stevens, Telmo de Menezes e Silva Filho, Zahraa Abdallah
• Abstract summary: Multi-step forecasting (MSF) in time-series is fundamental to almost all temporal domains. Previous work shows that it is not clear which forecasting strategy is optimal a priori to evaluating on unseen data. We propose Dynamic Strategies (DyStrat) for MSF.
• Score: 0.37141182051230903
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Multi-step forecasting (MSF) in time-series, the ability to make predictions multiple time steps into the future, is fundamental to almost all temporal domains. To make such forecasts, one must assume the recursive complexity of the temporal dynamics. Such assumptions are referred to as the forecasting strategy used to train a predictive model. Previous work shows that it is not clear which forecasting strategy is optimal a priori to evaluating on unseen data. Furthermore, current approaches to MSF use a single (fixed) forecasting strategy. In this paper, we characterise the instance-level variance of optimal forecasting strategies and propose Dynamic Strategies (DyStrat) for MSF. We experiment using 10 datasets from different scales, domains, and lengths of multi-step horizons. When using a random-forest-based classifier, DyStrat outperforms the best fixed strategy, which is not knowable a priori, 94% of the time, with an average reduction in mean-squared error of 11%. Our approach typically triples the top-1 accuracy compared to current approaches. Notably, we show DyStrat generalises well for any MSF task.

Related papers

• Loss Shaping Constraints for Long-Term Time Series Forecasting [79.3533114027664]
  We present a Constrained Learning approach for long-term time series forecasting that respects a user-defined upper bound on the loss at each time-step. We propose a practical Primal-Dual algorithm to tackle it, and aims to demonstrate that it exhibits competitive average performance in time series benchmarks, while shaping the errors across the predicted window.
  arXiv  Detail & Related papers  (2024-02-14T18:20:44Z)
• When Rigidity Hurts: Soft Consistency Regularization for Probabilistic Hierarchical Time Series Forecasting [69.30930115236228]
  Probabilistic hierarchical time-series forecasting is an important variant of time-series forecasting. Most methods focus on point predictions and do not provide well-calibrated probabilistic forecasts distributions. We propose PROFHiT, a fully probabilistic hierarchical forecasting model that jointly models forecast distribution of entire hierarchy.
  arXiv  Detail & Related papers  (2023-10-17T20:30:16Z)
• The Capacity and Robustness Trade-off: Revisiting the Channel Independent Strategy for Multivariate Time Series Forecasting [50.48888534815361]
  We show that models trained with the Channel Independent (CI) strategy outperform those trained with the Channel Dependent (CD) strategy. Our results conclude that the CD approach has higher capacity but often lacks robustness to accurately predict distributionally drifted time series. We propose a modified CD method called Predict Residuals with Regularization (PRReg) that can surpass the CI strategy.
  arXiv  Detail & Related papers  (2023-04-11T13:15:33Z)
• Sinkhorn-Flow: Predicting Probability Mass Flow in Dynamical Systems Using Optimal Transport [89.61692654941106]
  We propose a new approach to predicting such mass flow over time using optimal transport. We apply our approach to the task of predicting how communities will evolve over time in social network settings.
  arXiv  Detail & Related papers  (2023-03-14T07:25:44Z)
• When Rigidity Hurts: Soft Consistency Regularization for Probabilistic Hierarchical Time Series Forecasting [69.30930115236228]
  Probabilistic hierarchical time-series forecasting is an important variant of time-series forecasting. Most methods focus on point predictions and do not provide well-calibrated probabilistic forecasts distributions. We propose PROFHiT, a fully probabilistic hierarchical forecasting model that jointly models forecast distribution of entire hierarchy.
  arXiv  Detail & Related papers  (2022-06-16T06:13:53Z)
• Optimal Latent Space Forecasting for Large Collections of Short Time Series Using Temporal Matrix Factorization [0.0]
  It is a common practice to evaluate multiple methods and choose one of these methods or an ensemble for producing the best forecasts. We propose a framework for forecasting short high-dimensional time series data by combining low-rank temporal matrix factorization and optimal model selection on latent time series.
  arXiv  Detail & Related papers  (2021-12-15T11:39:21Z)
• Long Range Probabilistic Forecasting in Time-Series using High Order Statistics [19.12411040726229]
  We present a novel probabilistic forecasting method that produces forecasts coherent in terms of base level and predicted aggregate statistics. We show that our method improves forecast performance across both base level and unseen aggregates post inference on real datasets ranging three diverse domains.
  arXiv  Detail & Related papers  (2021-11-05T11:10:35Z)
• On the benefits of maximum likelihood estimation for Regression and Forecasting [35.386189585135334]
  We advocate for a practical Maximum Likelihood Estimation (MLE) approach for regression and forecasting. This approach is better suited to capture inductive biases such as prior domain knowledge in datasets. We demonstrate empirically that our method instantiated with a well-designed general purpose mixture likelihood family can obtain superior performance over Empirical Risk Minimization.
  arXiv  Detail & Related papers  (2021-06-18T22:10:43Z)
• Quantifying Uncertainty in Deep Spatiotemporal Forecasting [67.77102283276409]
  We describe two types of forecasting problems: regular grid-based and graph-based. We analyze UQ methods from both the Bayesian and the frequentist point view, casting in a unified framework via statistical decision theory. Through extensive experiments on real-world road network traffic, epidemics, and air quality forecasting tasks, we reveal the statistical computational trade-offs for different UQ methods.
  arXiv  Detail & Related papers  (2021-05-25T14:35:46Z)
• Simultaneously Reconciled Quantile Forecasting of Hierarchically Related Time Series [11.004159006784977]
  We propose a flexible nonlinear model that optimize quantile regression loss coupled with suitable regularization terms to maintain consistency of forecasts across hierarchies. The theoretical framework introduced herein can be applied to any forecasting model with an underlying differentiable loss function.
  arXiv  Detail & Related papers  (2021-02-25T00:59:01Z)
• Model selection in reconciling hierarchical time series [2.705025060422369]
  We propose an approach for dynamically selecting the most appropriate hierarchical forecasting method. The approach is based on Machine Learning classification methods and uses time series features as leading indicators. Our results suggest that conditional hierarchical forecasting leads to significantly more accurate forecasts than standard approaches.
  arXiv  Detail & Related papers  (2020-10-21T03:40:35Z)

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.