Short‐term load interval prediction with unilateral adaptive update strategy and simplified biased convex cost function

Abstract This article proposes a unilateral Adaptive update strategy based Interval Prediction (AIP) model for short‐term load prediction, which is developed based on lower and upper bound estimation (LUBE) architecture. In traditional LUBE interval prediction model, the model training is usually trained by heuristic algorithms. In this article, the model training is formulated as a bi‐level optimization problem with the help of proposed unilateral adaptive update strategy and cost function. In lower‐level problem, a simplified biased convex cost function is developed to supervise the learning direction of basic prediction engines. The basic prediction engine utilizes Gated Recurrent Unit (GRU) to extract features and Full connected Neural Network (FNN) to generate interval boundary. In upper‐level problem, a unilateral adaptive update strategy with unilateral coverage rate is put forward. It iteratively tunes hyper‐parameters of cost function during training process. Comprehensive experiments based on residential load data are implemented and the proposed interval prediction model outperforms the tested state‐of‐the‐art algorithms, achieving a 15% reduction in prediction error and a 20% decrease in computational time.

Authors

Institutions

Publication Details

Journal
IET Generation Transmission & Distribution
Published
2024-08-26
DOI
https://doi.org/10.1049/gtd2.13259
Citations
1
Primary Topic
Energy Load and Power Forecasting
Type
article
Field-Weighted Citation Impact
0.21

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Short‐term load interval prediction with unilateral adaptive update strategy and simplified biased convex cost function

Huan Long, Runhao Geng, Zhi Wu, Wei Gu et al.
1 citations
IET Generation Transmission & Distribution
Energy Load and Power Forecasting
0.21
article

Short‐term load interval prediction with unilateral adaptive update strategy and simplified biased convex cost function

Huan Long, Runhao Geng, Zhi Wu, Wei Gu, Shu Zheng, Jingtao Zhao
article en
1 citations

Abstract

Abstract This article proposes a unilateral Adaptive update strategy based Interval Prediction (AIP) model for short‐term load prediction, which is developed based on lower and upper bound estimation (LUBE) architecture. In traditional LUBE interval prediction model, the model training is usually trained by heuristic algorithms. In this article, the model training is formulated as a bi‐level optimization problem with the help of proposed unilateral adaptive update strategy and cost function. In lower‐level problem, a simplified biased convex cost function is developed to supervise the learning direction of basic prediction engines. The basic prediction engine utilizes Gated Recurrent Unit (GRU) to extract features and Full connected Neural Network (FNN) to generate interval boundary. In upper‐level problem, a unilateral adaptive update strategy with unilateral coverage rate is put forward. It iteratively tunes hyper‐parameters of cost function during training process. Comprehensive experiments based on residential load data are implemented and the proposed interval prediction model outperforms the tested state‐of‐the‐art algorithms, achieving a 15% reduction in prediction error and a 20% decrease in computational time.

IET Generation Transmission & DistributionVol. 18(19)
NARI Group (China) (CN), Southeast University (CN)
National Natural Science Foundation of China
Openalex Percentile: Top 49%
Energy Load and Power Forecasting
0.21
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.