TY - GEN
T1 - An Autoencoder-embedded Evolutionary Optimization Framework for High-dimensional Problems
AU - Cui, Meiji
AU - Li, Li
AU - Zhou, Meng Chu
N1 - Publisher Copyright:
© 2020 IEEE.
PY - 2020/10/11
Y1 - 2020/10/11
N2 - Many ever-increasingly complex engineering optimization problems fall into the class of High-dimensional Expensive Problems (HEPs), where fitness evaluations are very time-consuming. It is extremely challenging and difficult to produce promising solutions in high-dimensional search space. In this paper, an Autoencoder-embedded Evolutionary Optimization (AEO) framework is proposed for the first time. As an efficient dimension reduction tool, an autoencoder is used to compress high-dimensional landscape to informative low-dimensional space. The search operation in this low-dimensional space can facilitate the population converge towards the optima more efficiently. To balance the exploration and exploitation ability during optimization, two sub-populations coevolve in a distributed fashion, where one is assisted by an autoencoder and the other undergoes a regular evolutionary process. The information between these two sub-populations are dynamically exchanged. The proposed algorithm is validated by testing several 200 dimensional benchmark functions. Compared with the state-of-art algorithms for HEPs, AEO shows extraordinarily high efficiency for these challenging problems.
AB - Many ever-increasingly complex engineering optimization problems fall into the class of High-dimensional Expensive Problems (HEPs), where fitness evaluations are very time-consuming. It is extremely challenging and difficult to produce promising solutions in high-dimensional search space. In this paper, an Autoencoder-embedded Evolutionary Optimization (AEO) framework is proposed for the first time. As an efficient dimension reduction tool, an autoencoder is used to compress high-dimensional landscape to informative low-dimensional space. The search operation in this low-dimensional space can facilitate the population converge towards the optima more efficiently. To balance the exploration and exploitation ability during optimization, two sub-populations coevolve in a distributed fashion, where one is assisted by an autoencoder and the other undergoes a regular evolutionary process. The information between these two sub-populations are dynamically exchanged. The proposed algorithm is validated by testing several 200 dimensional benchmark functions. Compared with the state-of-art algorithms for HEPs, AEO shows extraordinarily high efficiency for these challenging problems.
KW - High-dimensional expensive problems (HEPs)
KW - artificial intelligence
KW - autoencoder
KW - dimension reduction
KW - evolutionary algorithms
KW - machine learning.
UR - http://www.scopus.com/inward/record.url?scp=85098892129&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85098892129&partnerID=8YFLogxK
U2 - 10.1109/SMC42975.2020.9282964
DO - 10.1109/SMC42975.2020.9282964
M3 - Conference contribution
AN - SCOPUS:85098892129
T3 - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
SP - 1046
EP - 1051
BT - 2020 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2020
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2020 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2020
Y2 - 11 October 2020 through 14 October 2020
ER -