Skip to content

Completely Derandomized Self-Adaptation in Evolution Strategies

Nikolaus Hansen, Andreas Ostermeier

Evolutionary Computation · 2001 · 4,622 citations

No retraction on record in OpenAlex.Check Crossref now

Cite this paper

Hansen, N., & Ostermeier, A. (2001). Completely derandomized self-adaptation in evolution strategies. Evolutionary Computation, 9(2), 159–195. https://doi.org/10.1162/106365601750190398

In text: (Hansen & Ostermeier, 2001)

Ask a question about this research

One question, free, no account. Anchorcite finds the papers, checks each against Crossref and links every sentence of the answer to the passage it comes from.

Abstract

This paper puts forward two useful methods for self-adaptation of the mutation distribution - the concepts of derandomization and cumulation. Principle shortcomings of the concept of mutative strategy parameter control and two levels of derandomization are reviewed. Basic demands on the self-adaptation of arbitrary (normal) mutation distributions are developed. Applying arbitrary, normal mutation distributions is equivalent to applying a general, linear problem encoding. The underlying objective of mutative strategy parameter control is roughly to favor previously selected mutation steps in the future. If this objective is pursued rigorously, a completely derandomized self-adaptation scheme results, which adapts arbitrary normal mutation distributions. This scheme, called covariance matrix adaptation (CMA), meets the previously stated demands. It can still be considerably improved by cumulation - utilizing an evolution path rather than single search steps. Simulations on various test functions reveal local and global search properties of the evolution strategy with and without covariance matrix adaptation. Their performances are comparable only on perfectly scaled functions. On badly scaled, non-separable functions usually a speed up factor of several orders of magnitude is observed. On moderately mis-scaled functions a speed up factor of three to ten can be expected.

  1. A fast and elitist multiobjective genetic algorithm: NSGA-II2002
  2. Particle swarm optimization2002
  3. Optimization by Simulated Annealing1983
  4. Statistical Learning Theory1999
  5. A new optimizer using particle swarm theory2002

Metadata from OpenAlex (CC0). Citations are generated from the published record.