The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Linearized domain adaptation in evolutionary multitasking
Abstract
Recent analytical studies have revealed that in spite of promising success in problem solving, the performance of evolutionary multitasking deteriorates with decreasing similarity between constitutive tasks. The present day multifactorial evolutionary algorithm (MFEA) is susceptible to negative knowledge transfer between uncorrelated tasks. To alleviate this issue, we propose a linearized domain adaptation (LDA) strategy that transforms the search space of a simple task to the search space similar to its constitutive complex task. This high order representative space resembles high correlation with its constitutive task and provides a platform for efficient knowledge transfer via crossover. The proposed framework, LDA-MFEA is tested on several benchmark problems constituting of tasks with different degrees of similarities and intersecting global optima. Experimental results demonstrate competitive performances against MFEA and shows that our proposition dramatically improves the performance relative to optimizing each task independently.
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
Pan, S. J., & Yang, Q. (2010) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2009.191 · Cited by 23,387
No free lunch theorems for optimization
Wolpert, D. H., & Macready, W. G. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585893 · Cited by 14,237
Caruana, R. (1998) · Learning to Learn · doi:10.1007/978-1-4615-5529-2_5 · Cited by 577
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-citationMultifactorial Evolutionary Algorithm With Online Transfer Parameter Estimation: MFEA-II
Bali, K. K., Ong, Y.-S., Gupta, A., & Tan, P. S. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2906927 · Cited by 437
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-citationGeneralized Multitasking for Evolutionary Optimization of Expensive Problems
Ding, J., Yang, C., Jin, Y., & Chai, T. (2019) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2017.2785351 · Cited by 277
Metadata
- Authors
- Bali, K. K., Gupta, A., Feng, L., Ong, Y. S., & Siew, T. P.
- Venue
- 2017 IEEE Congress on Evolutionary Computation (CEC)
- Publisher
- IEEE
- Published
- 2017-06
- Pages
- 1295-1302
- OpenAlex
- W2724993384
- Cited by
- 168
- References
- 3
- FWCI
- 4.95
- Type
- conference paper
- Language
- en
- Open access
- closed
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: Linearized domain adaptation in evolutionary multitasking. https://app.cochat.ai/papers/10.1109/cec.2017.7969454
- The paper
- Bali, K. K., Gupta, A., Feng, L., Ong, Y. S., & Siew, T. P. (2017). Linearized domain adaptation in evolutionary multitasking. 2017 IEEE Congress on Evolutionary Computation (CEC). https://doi.org/10.1109/cec.2017.7969454
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.