Curbing negative influences online for seamless transfer evolutionary optimization

• Main Authors: Da, Bingshui, Gupta, Abhishek, Ong, Yew-Soon
• Other Authors: School of Computer Science and Engineering
• Format: Article
• Language: English
• Published: 2020
• Subjects: Engineering::Computer science and engineering; Negative Transfer; Online Similarity Learning
• Online Access: https://hdl.handle.net/10356/139922
• Institution: Nanyang Technological University

This paper draws motivation from the remarkable ability of humans to extract useful building-blocks of knowledge from past experiences and spontaneously reuse them for new and more challenging tasks. It is contended that successfully replicating such capabilities in computational solvers, particularly global black-box optimizers, can lead to significant performance enhancements over the current state-of-the-art. The main challenge to overcome is that in general black-box settings, no problem-specific data may be available prior to the onset of the search, thereby limiting the possibility of offline measurement of the synergy between problems. In light of the above, this paper introduces a novel evolutionary computation framework that enables online learning and exploitation of similarities across optimization problems, with the goal of achieving an algorithmic realization of the transfer optimization paradigm. One of the salient features of our proposal is that it accounts for latent similarities which while being less apparent on the surface, may be gradually revealed during the course of the evolutionary search. A theoretical analysis of our proposed framework is carried out, substantiating its positive influences on optimization performance. Furthermore, the practical efficacy of an instantiation of an adaptive transfer evolutionary algorithm is demonstrated on a series of numerical examples, spanning discrete, continuous, as well as singleand multi-objective optimization.