An efficient optimization approach for designing machine learning models based on genetic algorithm

Authored by

Khader M. Hamdia, Xiaoying Zhuang, Timon Rabczuk

Abstract

Machine learning (ML) methods have shown powerful performance in different application. Nonetheless, designing ML models remains a challenge and requires further research as most procedures adopt a trial and error strategy. In this study, we present a methodology to optimize the architecture and the feature configurations of ML models considering a supervised learning process. The proposed approach employs genetic algorithm (GA)-based integer-valued optimization for two ML models, namely deep neural networks (DNN) and adaptive neuro-fuzzy inference system (ANFIS). The selected variables in the DNN optimization problems are the number of hidden layers, their number of neurons and their activation function, while the type and the number of membership functions are the design variables in the ANFIS optimization problem. The mean squared error (MSE) between the predictions and the target outputs is minimized as the optimization fitness function. The proposed scheme is validated through a case study of computational material design. We apply the method to predict the fracture energy of polymer/nanoparticles composites (PNCs) with a database gathered from the literature. The optimized DNN model shows superior prediction accuracy compared to the classical one-hidden layer network. Also, it outperforms ANFIS with significantly lower number of generations in GA. The proposed method can be easily extended to optimize similar architecture properties of ML models in various complex systems.

Details

Organisation(s)
Institute of Photonics
External Organisation(s)
Ton Duc Thang University
Bauhaus-Universität Weimar
Type
Article
Journal
Neural Computing and Applications
Volume
33
Pages
1923-1933
No. of pages
11
ISSN
0941-0643
Publication date
03.2021
Publication status
Published
Peer reviewed
Yes
ASJC Scopus subject areas
Software, Artificial Intelligence
Electronic version(s)
https://doi.org/10.1007/s00521-020-05035-x (Access: Open )
 

Cite

Loading...