HOPS: High-order Polynomials with Self-supervised Dimension Reduction for Load Forecasting

Pengyang Song, Han Feng, Shreyashi Shukla, Jue Wang, Tao Hong
1/18/2025
cs.LGeess.SY

No confident code implementation found for this paper.

Abstract

Load forecasting is a fundamental task in smart grid. Many techniques have been applied to developing load forecasting models. Due to the challenges such as the Curse of Dimensionality, overfitting, and limited computing resources, multivariate higher-order polynomial models have received limited attention in load forecasting, despite their desirable mathematical foundations and optimization properties. In this paper, we propose low rank approximation and self-supervised dimension reduction to address the aforementioned issues. To further improve computational efficiency, we also utilize a fast Conjugate Gradient based algorithm for the proposed polynomial models. Based on the load datasets from the ISO New England, the proposed method high-order polynomials with self-supervised dimension reduction (HOPS) demonstrates higher forecasting accuracy over several competitive models. Additionally, experimental results indicate that our approach alleviates redundant variable construction, achieving better forecasts with fewer input variables.

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!

Cite this paper

@article{song2025hops,
  title  = {HOPS: High-order Polynomials with Self-supervised Dimension Reduction for Load Forecasting},
  author = {Pengyang Song and Han Feng and Shreyashi Shukla and Jue Wang and Tao Hong},
  year   = {2025},
  eprint = {2501.10637},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2501.10637v2}
}

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/2501.10637.svg)](https://codeofpaper.com/paper/2501.10637)

Discussion