Learning From a Stream of Nonstationary and Dependent Data in Multiobjective Evolutionary Optimization

Abstract

Evolutionary algorithms (EAs) have been well acknowledged as a promising paradigm for solving optimisation problems with multiple conflicting objectives in the sense that they are able to locate a set of diverse approximations of Pareto optimal solutions in a single run. EAs drive the search for approximated solutions through maintaining a diverse population of solutions and by recombining promising solutions selected from the population. Combining machine learning techniques has shown great potentials since the intrinsic structure of the Pareto optimal solutions of an multiobjective optimisation problem can be learned and used to guide for effective recombination. However, existing multiobjective EAs (MOEAs) based on structure learning spend too much computational resources on learning. To address this problem, we propose to use an online learning scheme. Based on the fact that offsprings along evolution are streamy, dependent and non-stationary (which implies that the intrinsic structure, if any, is temporal and scale-variant), an online agglomerative clustering algorithm is applied to adaptively discover the intrinsic structure of the Pareto optimal solution set; and to guide effective offspring recombination. Experimental results have shown significant improvement over five state-of-theart MOEAs on a set of well-known benchmark problems with complicated Pareto sets and complex Pareto fronts. Index Terms-Multiobjective Optimization | Evolutionary Algorithms | Machine Learning | Online Agglomerative ClusteringJ. Sun is with the

A Multi-Objective Evolutionary Algorithm Based on KNN-Graph for Traffic Network Attack

“…Considering the non-stationary nature of multi-objective evolutionary algorithm data, Sun et al [26] designed an environment selection operator for online clustering of non-stationary and dependent data learning. Considering the non-stationary nature of multi-objective evolutionary algorithm data, Sun et al [26] designed an environment selection operator for online clustering of non-stationary data learning. Its operator combines the iterative process of online agglomeration clustering with the evolution process of evolutionary algorithms.…”

“…An efficient EMO method should make use of thus problem knowledge to guide its search directions. With this consideration, the clustering learning-based mating restriction strategies are popular practices [25][26][27]. In our previous work, the adaptive population structure learning and multi-source mating restriction [28,29] both have well performance while solving complex MOPs, however the clustering operation also brings a lot of computing overhead.…”

Data-driven software design with Constraint Oriented Multi-variate Bandit Optimization (COMBO)

“…Hundreds of metrics are reportedly used for a single experiment at Microsoft (Kevic et al 2017;Machmouchi and Buscher 2016). For optimization, multi-objective optimization (Nardi et al 2019;Sun et al 2018) can be applied offline at compile time, where someone can manually make a trade-off between metrics from a Pareto front. However, for the online bandit optimization algorithms, a single metric is required to serve as rewards (though that metric can be a scalar index).…”

Adaptive Differential Evolution With Evolution Memory for Multiobjective Optimization

“…In this experiment, the adaptive refining and the evolution memory strategy are not used to amplify the effect of the adaptive selection strategy. The algorithm without and with the adaptive mutation strategy are denoted as AMODEEM 3 and AMODEEM 4 respectively, and in AMODEEM 3 a mutation operator is randomly selected from the four ones. The mean and standard deviation of the IGD metric for the two algorithms are presented in Table 2.…”