Autoencoding evolutionary search with learning across heterogeneous problems
To enhance the search performance of evolutionary algorithms, reusing knowledge captured from past optimization experiences along the search process has been proposed in the literature, and demonstrated much promise. In the literature, there are generally three types of approaches for reusing knowle...
Saved in:
Main Authors: | , , , |
---|---|
Other Authors: | |
Format: | Article |
Language: | English |
Published: |
2021
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/147937 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-147937 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1479372021-05-01T20:12:48Z Autoencoding evolutionary search with learning across heterogeneous problems Feng, Liang Ong, Yew-Soon Jiang, Siwei Gupta, Abhishek School of Computer Science and Engineering Singapore Institute of Manufacturing Technology Engineering::Computer science and engineering Evolutionary Optimization Knowledge Transfer To enhance the search performance of evolutionary algorithms, reusing knowledge captured from past optimization experiences along the search process has been proposed in the literature, and demonstrated much promise. In the literature, there are generally three types of approaches for reusing knowledge from past search experiences, namely exact storage and reuse of past solutions, the reuse of model-based information, and the reuse of structured knowledge captured from past optimized solutions. In this paper, we focus on the third type of knowledge reuse for enhancing evolutionary search. In contrast to existing works, here we focus on knowledge transfer across heterogeneous continuous optimization problems with diverse properties, such as problem dimension, number of objectives, etc., that cannot be handled by existing approaches. In particular, we propose a novel autoencoding evolutionary search paradigm with learning capability across heterogeneous problems. The essential ingredient for learning structured knowledge from search experience in our proposed paradigm is a single layer denoising autoencoder (DA), which is able to build the connections between problem domains by treating past optimized solutions as the corrupted version of the solutions for the newly encountered problem. Further, as the derived DA holds a closed-form solution, the corresponding reusing of knowledge from past search experiences will not bring much additional computational burden on the evolutionary search. To evaluate the proposed search paradigm, comprehensive empirical studies on the complex multiobjective optimization problems are presented, along with a real-world case study from the fiber-reinforced polymer composites manufacturing industry. Nanyang Technological University Accepted version This work was supported in part by the National Natural Science Foundation of China under Grant 61603064, and in part by the Data Science and Artificial Intelligence Center at the Nanyang Technological University. 2021-04-15T08:30:31Z 2021-04-15T08:30:31Z 2017 Journal Article Feng, L., Ong, Y., Jiang, S. & Gupta, A. (2017). Autoencoding evolutionary search with learning across heterogeneous problems. IEEE Transactions On Evolutionary Computation, 21(5), 760-772. https://dx.doi.org/10.1109/TEVC.2017.2682274 1089-778X 0000-0002-8356-7242 0000-0002-6080-855X https://hdl.handle.net/10356/147937 10.1109/TEVC.2017.2682274 2-s2.0-85031317804 5 21 760 772 en IEEE Transactions on Evolutionary Computation © 2017 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. The published version is available at: https://doi.org/10.1109/TEVC.2017.2682274. application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Engineering::Computer science and engineering Evolutionary Optimization Knowledge Transfer |
spellingShingle |
Engineering::Computer science and engineering Evolutionary Optimization Knowledge Transfer Feng, Liang Ong, Yew-Soon Jiang, Siwei Gupta, Abhishek Autoencoding evolutionary search with learning across heterogeneous problems |
description |
To enhance the search performance of evolutionary algorithms, reusing knowledge captured from past optimization experiences along the search process has been proposed in the literature, and demonstrated much promise. In the literature, there are generally three types of approaches for reusing knowledge from past search experiences, namely exact storage and reuse of past solutions, the reuse of model-based information, and the reuse of structured knowledge captured from past optimized solutions. In this paper, we focus on the third type of knowledge reuse for enhancing evolutionary search. In contrast to existing works, here we focus on knowledge transfer across heterogeneous continuous optimization problems with diverse properties, such as problem dimension, number of objectives, etc., that cannot be handled by existing approaches. In particular, we propose a novel autoencoding evolutionary search paradigm with learning capability across heterogeneous problems. The essential ingredient for learning structured knowledge from search experience in our proposed paradigm is a single layer denoising autoencoder (DA), which is able to build the connections between problem domains by treating past optimized solutions as the corrupted version of the solutions for the newly encountered problem. Further, as the derived DA holds a closed-form solution, the corresponding reusing of knowledge from past search experiences will not bring much additional computational burden on the evolutionary search. To evaluate the proposed search paradigm, comprehensive empirical studies on the complex multiobjective optimization problems are presented, along with a real-world case study from the fiber-reinforced polymer composites manufacturing industry. |
author2 |
School of Computer Science and Engineering |
author_facet |
School of Computer Science and Engineering Feng, Liang Ong, Yew-Soon Jiang, Siwei Gupta, Abhishek |
format |
Article |
author |
Feng, Liang Ong, Yew-Soon Jiang, Siwei Gupta, Abhishek |
author_sort |
Feng, Liang |
title |
Autoencoding evolutionary search with learning across heterogeneous problems |
title_short |
Autoencoding evolutionary search with learning across heterogeneous problems |
title_full |
Autoencoding evolutionary search with learning across heterogeneous problems |
title_fullStr |
Autoencoding evolutionary search with learning across heterogeneous problems |
title_full_unstemmed |
Autoencoding evolutionary search with learning across heterogeneous problems |
title_sort |
autoencoding evolutionary search with learning across heterogeneous problems |
publishDate |
2021 |
url |
https://hdl.handle.net/10356/147937 |
_version_ |
1698713720555831296 |