Multi-task Online Learning for Probabilistic Load Forecasting

Onintze Zaballa, Verónica Álvarez, Santiago Mazuelas
2/6/2025
stat.MLcs.LG

No confident code implementation found for this paper.

Abstract

Load forecasting is essential for the efficient, reliable, and cost-effective management of power systems. Load forecasting performance can be improved by learning the similarities among multiple entities (e.g., regions, buildings). Techniques based on multi-task learning obtain predictions by leveraging consumption patterns from the historical load demand of multiple entities and their relationships. However, existing techniques cannot effectively assess inherent uncertainties in load demand or account for dynamic changes in consumption patterns. This paper proposes a multi-task learning technique for online and probabilistic load forecasting. This technique provides accurate probabilistic predictions for the loads of multiple entities by leveraging their dynamic similarities. The method's performance is evaluated using datasets that register the load demand of multiple entities and contain diverse and dynamic consumption patterns. The experimental results show that the proposed method can significantly enhance the effectiveness of current multi-task learning approaches across a wide variety of load consumption scenarios.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{zaballa2025multitask,
  title  = {Multi-task Online Learning for Probabilistic Load Forecasting},
  author = {Onintze Zaballa and Verónica Álvarez and Santiago Mazuelas},
  year   = {2025},
  eprint = {2502.04163},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.04163v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.04163.svg)](https://codeofpaper.com/paper/2502.04163)

Discussion