Regularization methods for the short-term forecasting of the Italian electric load

• URL: http://arxiv.org/abs/2112.04604v1
• Date: Wed, 8 Dec 2021 22:15:06 GMT
• Title: Regularization methods for the short-term forecasting of the Italian electric load
• Authors: Alessandro Incremona and Giuseppe De Nicolao
• Abstract summary: The problem of forecasting the whole 24 profile of the Italian electric load is addressed as a multitask learning problem. The 96x96 matrix weights form a 96x96 matrix, that can be seen and displayed as a surface sampled on a square domain. Different regularization and sparsity approaches to reduce the degrees of freedom of the surface were explored, comparing the obtained forecasts with those of the Italian Transmission System Operator Terna.
• Score: 77.34726150561087
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The problem of forecasting the whole 24 profile of the Italian electric load is addressed as a multitask learning problem, whose complexity is kept under control via alternative regularization methods. In view of the quarter-hourly samplings, 96 predictors are used, each of which linearly depends on 96 regressors. The 96x96 matrix weights form a 96x96 matrix, that can be seen and displayed as a surface sampled on a square domain. Different regularization and sparsity approaches to reduce the degrees of freedom of the surface were explored, comparing the obtained forecasts with those of the Italian Transmission System Operator Terna. Besides outperforming Terna in terms of quarter-hourly mean absolute percentage error and mean absolute error, the prediction residuals turned out to be weakly correlated with Terna, which suggests that further improvement could ensue from forecasts aggregation. In fact, the aggregated forecasts yielded further relevant drops in terms of quarter-hourly and daily mean absolute percentage error, mean absolute error and root mean square error (up to 30%) over the three test years considered.

Related papers

• Attention-Based Ensemble Pooling for Time Series Forecasting [55.2480439325792]
  We propose a method for pooling that performs a weighted average over candidate model forecasts. We test this method on two time-series forecasting problems: multi-step forecasting of the dynamics of the non-stationary Lorenz 63 equation, and one-step forecasting of the weekly incident deaths due to COVID-19.
  arXiv  Detail & Related papers  (2023-10-24T22:59:56Z)
• 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)
• Frugal day-ahead forecasting of multiple local electricity loads by aggregating adaptive models [0.0]
  We focus on day-ahead electricity load forecasting of substations of the distribution network in France. We develop a frugal variant, reducing the number of parameters estimated, to achieve transfer learning. We highlight the interpretability of the models, which is important for operational applications.
  arXiv  Detail & Related papers  (2023-02-16T10:17:19Z)
• 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)
• Exploring the impact of spatiotemporal granularity on the demand prediction of dynamic ride-hailing [2.5489902365061607]
  This paper attempts to examine effects on ride-temporal demand prediction accuracy by using empirical data for Chengdu, China. A convolutional, short-term memory model combined with a hexagonal convolution operation (H-ConvLSTM) is proposed to explore the complex spatial and temporal relations.
  arXiv  Detail & Related papers  (2022-03-19T11:22:04Z)
• Robust Nonparametric Distribution Forecast with Backtest-based Bootstrap and Adaptive Residual Selection [14.398720944586803]
  Distribution forecast can quantify forecast uncertainty and provide various forecast scenarios with corresponding estimated probabilities. We propose a practical and robust distribution forecast framework that relies on backtest-based bootstrap and adaptive residual selection.
  arXiv  Detail & Related papers  (2022-02-16T09:53:48Z)
• Near-optimal inference in adaptive linear regression [60.08422051718195]
  Even simple methods like least squares can exhibit non-normal behavior when data is collected in an adaptive manner. We propose a family of online debiasing estimators to correct these distributional anomalies in at least squares estimation. We demonstrate the usefulness of our theory via applications to multi-armed bandit, autoregressive time series estimation, and active learning with exploration.
  arXiv  Detail & Related papers  (2021-07-05T21:05:11Z)
• Batch Stationary Distribution Estimation [98.18201132095066]
  We consider the problem of approximating the stationary distribution of an ergodic Markov chain given a set of sampled transitions. We propose a consistent estimator that is based on recovering a correction ratio function over the given data.
  arXiv  Detail & Related papers  (2020-03-02T09:10:01Z)

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.