Loss Shaping Constraints for Long-Term Time Series Forecasting

• URL: http://arxiv.org/abs/2402.09373v2
• Date: Thu, 11 Jul 2024 23:43:18 GMT
• Title: Loss Shaping Constraints for Long-Term Time Series Forecasting
• Authors: Ignacio Hounie, Javier Porras-Valenzuela, Alejandro Ribeiro,
• Abstract summary: 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.
• Score: 79.3533114027664
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Several applications in time series forecasting require predicting multiple steps ahead. Despite the vast amount of literature in the topic, both classical and recent deep learning based approaches have mostly focused on minimising performance averaged over the predicted window. We observe that this can lead to disparate distributions of errors across forecasting steps, especially for recent transformer architectures trained on popular forecasting benchmarks. That is, optimising performance on average can lead to undesirably large errors at specific time-steps. In this work, we present a Constrained Learning approach for long-term time series forecasting that aims to find the best model in terms of average performance that respects a user-defined upper bound on the loss at each time-step. We call our approach loss shaping constraints because it imposes constraints on the loss at each time step, and leverage recent duality results to show that despite its non-convexity, the resulting problem has a bounded duality gap. We propose a practical Primal-Dual algorithm to tackle it, and demonstrate that the proposed approach exhibits competitive average performance in time series forecasting benchmarks, while shaping the distribution of errors across the predicted window.

Related papers

• MGCP: A Multi-Grained Correlation based Prediction Network for Multivariate Time Series [54.91026286579748]
  We propose a Multi-Grained Correlations-based Prediction Network. It simultaneously considers correlations at three levels to enhance prediction performance. It employs adversarial training with an attention mechanism-based predictor and conditional discriminator to optimize prediction results at coarse-grained level.
  arXiv  Detail & Related papers  (2024-05-30T03:32:44Z)
• Successive Model-Agnostic Meta-Learning for Few-Shot Fault Time Series Prognosis [3.5573601621032944]
  We introduce a novel 'pseudo meta-task' partitioning scheme that treats a continuous time period of a time series as a meta-task. Employing continuous time series as pseudo meta-tasks allows our method to extract more comprehensive features and relationships from the data. We introduce a differential algorithm to enhance the robustness of our method across different datasets.
  arXiv  Detail & Related papers  (2023-11-04T02:07:47Z)
• Hierarchical Forecasting at Scale [55.658563862299495]
  Existing hierarchical forecasting techniques scale poorly when the number of time series increases. We propose to learn a coherent forecast for millions of time series with a single bottom-level forecast model. We implement our sparse hierarchical loss function within an existing forecasting model at bol, a large European e-commerce platform.
  arXiv  Detail & Related papers  (2023-10-19T15:06:31Z)
• Counterfactual Explanations for Time Series Forecasting [14.03870816983583]
  We formulate the novel problem of counterfactual generation for time series forecasting, and propose an algorithm, called ForecastCF. ForecastCF solves the problem by applying gradient-based perturbations to the original time series. Our results show that ForecastCF outperforms the baseline in terms of counterfactual validity and data manifold closeness.
  arXiv  Detail & Related papers  (2023-10-12T08:51:59Z)
• Performative Time-Series Forecasting [71.18553214204978]
  We formalize performative time-series forecasting (PeTS) from a machine-learning perspective. We propose a novel approach, Feature Performative-Shifting (FPS), which leverages the concept of delayed response to anticipate distribution shifts. We conduct comprehensive experiments using multiple time-series models on COVID-19 and traffic forecasting tasks.
  arXiv  Detail & Related papers  (2023-10-09T18:34:29Z)
• 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)
• Low-Rank Temporal Attention-Augmented Bilinear Network for financial time-series forecasting [93.73198973454944]
  Deep learning models have led to significant performance improvements in many problems coming from different domains, including prediction problems of financial time-series data. The Temporal Attention-Augmented Bilinear network was recently proposed as an efficient and high-performing model for Limit Order Book time-series forecasting. In this paper, we propose a low-rank tensor approximation of the model to further reduce the number of trainable parameters and increase its speed.
  arXiv  Detail & Related papers  (2021-07-05T10:15:23Z)
• The Perils of Learning Before Optimizing [16.97597806975415]
  We show how prediction models can be learned end-to-end by differentiating through the optimization task. We show that the performance gap between a two-stage and end-to-end approach is closely related to the emphprice of correlation concept in optimization.
  arXiv  Detail & Related papers  (2021-06-18T20:43:47Z)
• Bridging the Gap Between Training and Inference for Spatio-Temporal Forecasting [16.06369357595426]
  We propose a novel curriculum learning based strategy named Temporal Progressive Growing Sampling to bridge the gap between training and inference for S-temporal sequence forecasting. Experimental results demonstrate that our proposed method better models long term dependencies and outperforms baseline approaches on two competitive datasets.
  arXiv  Detail & Related papers  (2020-05-19T10:14:43Z)
• Optimizing for the Future in Non-Stationary MDPs [52.373873622008944]
  We present a policy gradient algorithm that maximizes a forecast of future performance. We show that our algorithm, called Prognosticator, is more robust to non-stationarity than two online adaptation techniques.
  arXiv  Detail & Related papers  (2020-05-17T03:41:19Z)

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.