Learning Graph Structures and Uncertainty for Accurate and Calibrated Time-series Forecasting

• URL: http://arxiv.org/abs/2407.02641v1
• Date: Tue, 2 Jul 2024 20:14:32 GMT
• Title: Learning Graph Structures and Uncertainty for Accurate and Calibrated Time-series Forecasting
• Authors: Harshavardhan Kamarthi, Lingkai Kong, Alexander Rodriguez, Chao Zhang, B Aditya Prakash,
• Abstract summary: We introduce STOIC, that leverages correlations between time-series to learn underlying structure between time-series and to provide well-calibrated and accurate forecasts. Over a wide-range of benchmark datasets STOIC provides 16% more accurate and better-calibrated forecasts.
• Score: 65.40983982856056
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Multi-variate time series forecasting is an important problem with a wide range of applications. Recent works model the relations between time-series as graphs and have shown that propagating information over the relation graph can improve time series forecasting. However, in many cases, relational information is not available or is noisy and reliable. Moreover, most works ignore the underlying uncertainty of time-series both for structure learning and deriving the forecasts resulting in the structure not capturing the uncertainty resulting in forecast distributions with poor uncertainty estimates. We tackle this challenge and introduce STOIC, that leverages stochastic correlations between time-series to learn underlying structure between time-series and to provide well-calibrated and accurate forecasts. Over a wide-range of benchmark datasets STOIC provides around 16% more accurate and 14% better-calibrated forecasts. STOIC also shows better adaptation to noise in data during inference and captures important and useful relational information in various benchmarks.

Related papers

• Relational Conformal Prediction for Correlated Time Series [56.59852921638328]
  We propose a novel distribution-free approach based on conformal prediction framework and quantile regression. We fill this void by introducing a novel conformal prediction method based on graph deep learning operators. Our approach provides accurate coverage and archives state-of-the-art uncertainty quantification in relevant benchmarks.
  arXiv  Detail & Related papers  (2025-02-13T16:12:17Z)
• From Link Prediction to Forecasting: Addressing Challenges in Batch-based Temporal Graph Learning [0.716879432974126]
  We show that the suitability of common batch-oriented evaluation depends on the datasets' characteristics. For continuous-time temporal graphs, fixed-size batches create time windows with different durations, resulting in an inconsistent dynamic link prediction task. For discrete-time temporal graphs, the sequence of batches can additionally introduce temporal dependencies that are not present in the data.
  arXiv  Detail & Related papers  (2024-06-07T12:45:12Z)
• 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)
• An End-to-End Time Series Model for Simultaneous Imputation and Forecast [14.756607742477252]
  We develop an end-to-end time series model that aims to learn the inference relation and make a multiple-step ahead forecast. Our framework trains jointly two neural networks, one to learn the feature-wise correlations and the other for the modeling of temporal behaviors.
  arXiv  Detail & Related papers  (2023-06-01T15:08:22Z)
• Discovering Predictable Latent Factors for Time Series Forecasting [39.08011991308137]
  We develop a novel framework for inferring the intrinsic latent factors implied by the observable time series. We introduce three characteristics, i.e., predictability, sufficiency, and identifiability, and model these characteristics via the powerful deep latent dynamics models. Empirical results on multiple real datasets show the efficiency of our method for different kinds of time series forecasting.
  arXiv  Detail & Related papers  (2023-03-18T14:37:37Z)
• 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)
• TACTiS: Transformer-Attentional Copulas for Time Series [76.71406465526454]
  estimation of time-varying quantities is a fundamental component of decision making in fields such as healthcare and finance. We propose a versatile method that estimates joint distributions using an attention-based decoder. We show that our model produces state-of-the-art predictions on several real-world datasets.
  arXiv  Detail & Related papers  (2022-02-07T21:37:29Z)
• RNN with Particle Flow for Probabilistic Spatio-temporal Forecasting [30.277213545837924]
  Many classical statistical models often fall short in handling the complexity and high non-linearity present in time-series data. In this work, we consider the time-series data as a random realization from a nonlinear state-space model. We use particle flow as the tool for approximating the posterior distribution of the states, as it is shown to be highly effective in complex, high-dimensional settings.
  arXiv  Detail & Related papers  (2021-06-10T21:49:23Z)
• Transformer Hawkes Process [79.16290557505211]
  We propose a Transformer Hawkes Process (THP) model, which leverages the self-attention mechanism to capture long-term dependencies. THP outperforms existing models in terms of both likelihood and event prediction accuracy by a notable margin. We provide a concrete example, where THP achieves improved prediction performance for learning multiple point processes when incorporating their relational information.
  arXiv  Detail & Related papers  (2020-02-21T13:48:13Z)

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.