arrow
返回

Hyperparameter Optimization Using Iterative Decision Tree (IDT)

delete2022-01-01
delete3
PRE
AI
N
Narith Saum
S
Satoshi Sugiura
M
Mongkut Piantanakulchai *
DOI:10.1109/ACCESS.2022.3212387delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
Machine learning and deep learning have gained a lot of attention from researchers because of their promising predictive performance and the availability of extensive high-dimensional data and high-performance computational hardware. However, the performance of these algorithms is susceptible to the choice of hyperparameters, while optimizing these hyperparameters is usually computationally expensive. For this reason, this study proposed a novel sequential search algorithm using decision tree regression as the surrogate function. In each iteration of this algorithm, several new combinations of hyperparameters were selected from a few best-performed leaves of the decision tree, called Iterative Decision Tree (IDT). Our approach could reduce the computational time from repetitive training the surrogate function compared to conventional sequential search algorithms and enable parallel computing. To confirm the effectiveness of the proposed algorithm, it was compared with six popular benchmark optimization algorithms, including Grid Search, Random Search, Bayesian Optimization, Random Forest, Tree-Structured Parzen Estimation, and Genetic Algorithm. The comparison was examined by optimizing three benchmark nonconvex functions, and hyperparameter tuning of two machine learning algorithms (Support Vector Machine and Random Forest) and two deep learning models (Autoencoder and Convolutional Neural Networks). As a result, the proposed algorithm achieved competitive performance with high stability in addition to the feature importance metrics.
Keyword:
Optimization
Machine learning algorithms
Linear programming
Training
Genetic algorithms
Deep learning
Search problems
Decision tree
deep learning
feature importance
hyperparameter optimization
machine learning

期刊

IEEE Access 封面图
IEEE Access
IF:
3.6
论文数:
9.8W
被引数:
29.4W

机构

T
Thammasat University
学者数:
3.9K
论文数: 3.4K
被引数: 2.9K
H
Hokkaido University
学者数:
3.6W
论文数: 2.5W
被引数: 2.6W
引用论文

引用论文

Lead-free KNN-based thin films obtained by pulsed laser deposition通过脉冲激光沉积获得的无铅KNN基薄膜
err2022-06-27
err0
errOAAI
errBrenda Carreno-Jimenez; Jose Luis Benitez-Benitez; Rosalba Castaneda-Guzman; M. Acuautla; Rigoberto Lopez-Juarez
err分享
err收藏
Taking the Human Out of the Loop: A Review of Bayesian Optimization将人类带出循环: 贝叶斯优化的回顾
err2016-01-01
err3.5K
PREAI
errShahriari, Bobak; Swersky, Kevin; Wang, Ziyu; Adams, Ryan P.; de Freitas, Nando
err分享
err收藏
err分享
err收藏
Moving Biopolitics
err2014-07-14
err0
PREAI
errJoshua I. Newman; Michael D. Giardina
err分享
err收藏
err分享
err收藏
Long Short Term Memory Hyperparameter Optimization for a Neural Network Based Emotion Recognition Framework
err2018-01-01
err90
errOAAI
errNakisa, Bahareh; Rastgoo, Mohammad Naim; Rakotonirainy, Andry; Maire, Frederic; Chandran, Vinod
err分享
err收藏
学者 查看更多内容