Advanced hyperparameter optimization of deep learning models for wind power prediction

超参数 超参数优化 计算机科学 均方误差 人工智能 机器学习 估计员 人工神经网络 卷积神经网络 风力发电 随机森林 深度学习 支持向量机 统计 数学 工程类 电气工程
作者
Shahram Hanifi,Andrea Cammarono,Hossein Zare‐Behtash
出处
期刊:Renewable Energy [Elsevier BV]
卷期号:221: 119700-119700 被引量:24
标识
DOI:10.1016/j.renene.2023.119700
摘要

The uncertainty of wind power as the main obstacle of its integration into the power grid can be addressed by an accurate and efficient wind power forecast. Among the various wind power forecasting methods, machine learning (ML) algorithms, are recognized as a powerful wind power forecasting tool, however, their performance is highly dependent on the proper tuning of their hyperparameters. Common hyperparameter tuning methods such as grid search or random search are time-consuming, computationally expensive, and unreliable for complex models such as deep learning neural networks. Therefore, there is an urgent need for automatic methods to discover optimal hyperparameters for higher accuracy and efficiency of prediction models. In this study, a novel investigation is contributed to the field of wind power forecasting by a comprehensive comparison of three advanced techniques – Scikit-opt, Optuna, and Hyperopt – for hyperparameter optimisation of Convolutional Neural Network (CNN) and Long Short-Term Memory Network (LSTM) models, a facet that, to our knowledge, has not been systematically explored in existing literature. The impact of these optimisation techniques on the accuracy and efficiency of the CNN and LSTM models are assessed by comparing the root mean square error (RMSE) of the predictions and the required time to tune the models. The results show that the Optuna algorithm, using a Tree-structured Parzen Estimator (TPE) search method and Expected Improvement (EI) acquisition function, has the best efficiency for both CNN and LSTM models. In terms of accuracy, it is demonstrated that while for the CNN model all the optimisation methods achieve similar performances, the LSTM model optimised by the Hyperopt algorithm, based on the annealing search method, results in the highest accuracy. In addition, for the first time in this research, the impact of the random initialization features on the performance of the forecasting models with neural networks is investigated. The proposed structures for deep learning models were examined to determine the most robust structure with the minimal sensitivity to the randomness. What we have discovered from the comparison of advanced hyperparameter optimization methods can be used by researchers to tune the time series-based forecasting models.

科研通智能强力驱动
Strongly Powered by AbleSci AI
科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
刚刚
1秒前
lumi应助活泼的萝卜采纳,获得10
2秒前
hhhhhhh完成签到 ,获得积分10
2秒前
3秒前
wanci应助lqnb668采纳,获得10
3秒前
5秒前
5秒前
wxx1发布了新的文献求助10
6秒前
7秒前
8秒前
无花果应助活泼的萝卜采纳,获得10
9秒前
Akim应助空空采纳,获得10
9秒前
可爱的函函应助FFFF采纳,获得10
9秒前
希望天下0贩的0应助Zhu XY.采纳,获得10
10秒前
xmn发布了新的文献求助50
10秒前
10秒前
纯真毛豆发布了新的文献求助10
10秒前
11秒前
11秒前
11秒前
科研通AI6.2应助wztao采纳,获得10
11秒前
今夜有雨发布了新的文献求助10
12秒前
cryfmm完成签到 ,获得积分10
12秒前
13秒前
打打应助SkyNotFound采纳,获得10
14秒前
充电宝应助独特冬莲采纳,获得10
14秒前
15秒前
维尼发布了新的文献求助10
16秒前
走马发布了新的文献求助10
16秒前
16秒前
FFFF完成签到,获得积分10
17秒前
Zcl完成签到 ,获得积分10
18秒前
鼻揩了转去应助wztao采纳,获得10
18秒前
19秒前
CipherSage应助纯真毛豆采纳,获得10
19秒前
20秒前
WW发布了新的文献求助10
20秒前
22秒前
23秒前
高分求助中
(应助此贴封号)【重要!!请各用户(尤其是新用户)详细阅读】【科研通的精品贴汇总】 10000
Römisch-Germanische Forschungen 1000
APA handbook of comparative psychology: Basic concepts, methods, neural substrate, and behavior 1000
Matrix Methods in Data Mining and Pattern Recognition Second Edition 510
The fast track to determining transfer functions of linear circuits: The student guide 500
Electric machines: theory, operating applications, and controls 500
The Analytical and Numerical Solution of Electric and Magnetic Fields 500
热门求助领域 (近24小时)
化学 材料科学 医学 生物 纳米技术 工程类 有机化学 化学工程 生物化学 计算机科学 内科学 物理 复合材料 催化作用 细胞生物学 无机化学 光电子学 物理化学 电极 基因
热门帖子
关注 科研通微信公众号,转发送积分 7603108
求助须知:如何正确求助?哪些是违规求助? 9179019
关于积分的说明 19657485
捐赠科研通 7178326
什么是DOI,文献DOI怎么找? 3269128
关于科研通互助平台的介绍 2433278
邀请新用户注册赠送积分活动 2262961