Please use this identifier to cite or link to this item:
Title: Multifactorial evolutionary algorithm with online transfer parameter estimation : MFEA-II
Authors: Bali, Kavitesh Kumar
Ong, Yew-Soon
Gupta, Abhishek
Tan, Puay Siew
Keywords: Engineering::Computer science and engineering
Issue Date: 2019
Source: Bali, K. K., Ong, Y.-S., Gupta, A., & Tan, P. S. (2020). Multifactorial evolutionary algorithm with online transfer parameter estimation : MFEA-II. IEEE Transactions on Evolutionary Computation, 24(1), 69-83. doi:10.1109/tevc.2019.2906927
Journal: IEEE Transactions on Evolutionary Computation
Abstract: Humans rarely tackle every problem from scratch. Given this observation, the motivation for this paper is to improve optimization performance through adaptive knowledge transfer across related problems. The scope for spontaneous transfers under the simultaneous occurrence of multiple problems unveils the benefits of multitasking. Multitask optimization has recently demonstrated competence in solving multiple (related) optimization tasks concurrently. Notably, in the presence of underlying relationships between problems, the transfer of high-quality solutions across them has shown to facilitate superior performance characteristics. However, in the absence of any prior knowledge about the intertask synergies (as is often the case with general black-box optimization), the threat of predominantly negative transfer prevails. Susceptibility to negative intertask interactions can impede the overall convergence behavior. To allay such fears, in this paper, we propose a novel evolutionary computation framework that enables online learning and exploitation of the similarities (and discrepancies) between distinct tasks in multitask settings, for an enhanced optimization process. Our proposal is based on the principled theoretical arguments that seek to minimize the tendency of harmful interactions between tasks, based on a purely data-driven learning of relationships among them. The efficacy of our proposed method is validated experimentally on a series of synthetic benchmarks, as well as a practical study that provides insights into the behavior of the method in the face of several tasks occurring at once.
ISSN: 1089-778X
DOI: 10.1109/TEVC.2019.2906927
Rights: © 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtaind 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:
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SCSE Journal Articles


Updated on Sep 5, 2020

Citations 50

Updated on Nov 21, 2020

Page view(s) 50

Updated on Nov 24, 2020

Download(s) 50

Updated on Nov 24, 2020

Google ScholarTM




Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.