Evolution strategies with thresheld convergence
- 1 May 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 1089778X,p. 2097-2104
Abstract
When optimizing multi-modal spaces, effective search techniques must carefully balance two conflicting tasks: exploration and exploitation. The first refers to the process of identifying promising areas in the search space. The second refers to the process of actually finding the local optima in these areas. This balance becomes increasingly important in stochastic search, where the only knowledge about a function's landscape relies on the relative comparison of random samples. Thresheld convergence is a technique designed to effectively separate the processes of exploration and exploitation. This paper addresses the design of thresheld convergence in the context of evolution strategies. We analyze the behavior of the standard (μ, λ)-ES on multi-modal landscapes and argue that part of it's shortcomings are due to an ineffective balance between exploration and exploitation. Afterwards we present a design for thresheld convergence tailored to ES, as a simple yet effective mechanism to increase the performance of (μ, λ)-ES on multimodal functions.Keywords
This publication has 12 references indexed in Scilit:
- Identifying and exploiting the scale of a search space in differential evolution2014
- Differential evolution with thresheld convergence2013
- Particle swarm optimization with thresheld convergence2013
- Simulated annealing with thresheld convergence2012
- The CMA Evolution Strategy: A Comparing Review2007
- Niching in evolution strategies2005
- Evolution strategies – A comprehensive introductionNatural Computing, 2002
- Toward a Theory of Evolution Strategies: Self-AdaptationEvolutionary Computation, 1995
- Towards a theory of ‘evolution strategies’: Results for (1,+λ)-strategies on (nearly) arbitrary fitness functions1994
- The parallel genetic algorithm as function optimizerParallel Computing, 1991