The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Autoencoding Evolutionary Search With Learning Across Heterogeneous Problems
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Machine learning: Trends, perspectives, and prospects
Jordan, M. I., & Mitchell, T. M. (2015) · Science · doi:10.1126/science.aaa8415 · Cited by 9,955
Learning Deep Architectures for AI
Bengio, Y. (2009) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000006 · Cited by 9,239
(2010) · Journal of Machine Learning Research · doi:10.5555/1756006.1953039 · Cited by 4,051
Evolutionary computation: Comments on the history and current state
Back, T., Hammel, U., & Schwefel, H.-P. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585888 · Cited by 1,536 · cited 1×
“EVOLUTIONARY algorithms (EAs) are population-based search methods which work on Darwinian principles of natural selection or survival of the fittest [1].”
Background
Cited by
Evolutionary Multitasking via Explicit Autoencoding
Feng, L., Zhou, L., Zhong, J., Gupta, A., Ong, Y.-S., Tan, K.-C., & Qin, A. K. (2019) · IEEE Transactions on Cybernetics · doi:10.1109/tcyb.2018.2845361 · Cited by 438
Self-citationInsights on Transfer Optimization: Because Experience is the Best Teacher
Gupta, A., Ong, Y.-S., & Feng, L. (2018) · IEEE Transactions on Emerging Topics in Computational Intelligence · doi:10.1109/tetci.2017.2769104 · Cited by 378
Self-citationEvolutionary Transfer Optimization - A New Frontier in Evolutionary Computation Research
Tan, K. C., Feng, L., & Jiang, M. (2021) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2020.3039066 · Cited by 315
Self-citationMinimalistic Attacks: How Little It Takes to Fool Deep Reinforcement Learning Policies
Qu, X., Sun, Z., Ong, Y.-S., Gupta, A., & Wei, P. (2021) · IEEE Transactions on Cognitive and Developmental Systems · doi:10.1109/tcds.2020.2974509 · Cited by 40
Self-citation
Metadata
- Authors
- Feng, L., Ong, Y.-S., Jiang, S., & Gupta, A.
- Venue
- IEEE Transactions on Evolutionary Computation
- Published
- 2017-10
- Volume
- 21
- Issue
- 5
- Pages
- 760-772
- ISSN
- 1089-778X (ISSN-L)
- 1941-0026
- OpenAlex
- W2595502370
- Cited by
- 159
- References
- 4
- FWCI
- 6.23
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Autoencoding Evolutionary Search With Learning Across Heterogeneous Problems. https://app.cochat.ai/papers/10.1109/tevc.2017.2682274
- The paper
- Feng, L., Ong, Y.-S., Jiang, S., & Gupta, A. (2017). Autoencoding Evolutionary Search With Learning Across Heterogeneous Problems. IEEE Transactions on Evolutionary Computation. https://doi.org/10.1109/tevc.2017.2682274
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.