DeepAI AI Chat
Log In Sign Up

How Far Are We From an Optimal, Adaptive DE?

by   Ryoji Tanabe, et al.

We consider how an (almost) optimal parameter adaptation process for an adaptive DE might behave, and compare the behavior and performance of this approximately optimal process to that of existing, adaptive mechanisms for DE. An optimal parameter adaptation process is an useful notion for analyzing the parameter adaptation methods in adaptive DE as well as other adaptive evolutionary algorithms, but it cannot be known generally. Thus, we propose a Greedy Approximate Oracle method (GAO) which approximates an optimal parameter adaptation process. We compare the behavior of GAODE, a DE algorithm with GAO, to typical adaptive DEs on six benchmark functions and the BBOB benchmarks, and show that GAO can be used to (1) explore how much room for improvement there is in the performance of the adaptive DEs, and (2) obtain hints for developing future, effective parameter adaptation methods for adaptive DEs.


page 1

page 2

page 3

page 4


Analyzing Adaptive Parameter Landscapes in Parameter Adaptation Methods for Differential Evolution

Since the scale factor and the crossover rate significantly influence th...

TPAM: A Simulation-Based Model for Quantitatively Analyzing Parameter Adaptation Methods

While a large number of adaptive Differential Evolution (DE) algorithms ...

Use of statistical outlier detection method in adaptive evolutionary algorithms

In this paper, the issue of adapting probabilities for Evolutionary Algo...

Leveraging Evolutionary Search to Discover Self-Adaptive and Self-Organizing Cellular Automata

Building self-adaptive and self-organizing (SASO) systems is a challengi...

BASBA: a framework for Building Adaptable Service-Based Applications

Due to the continuously changing environment of service-based applicatio...

Elicitation of Adaptive Requirements Using Creativity Triggers: A Controlled Experiment

Adaptive systems react to changes in their environment by changing their...