Adaptive Encoding: How to Render Search Coordinate System Invariant

Abstract : This paper describes a method for rendering search coordinate system independent, Adaptive Encoding. Adaptive Encoding is applicable to any iterative search algorithm and employs incremental changes of the representation of solutions. One attractive way to change the representation in the continuous domain is derived from Covariance Matrix Adaptation (CMA). In this case, adaptive encoding recovers the CMA evolution strategy, when applied to an evolution strategy with cumulative step-size control. Consequently, adaptive encoding provides the means to apply CMA-like representation changes to any search algorithm in the continuous domain. Experimental results confirm the expectation that CMA-based adaptive encoding will generally speed up a typical evolutionary algorithm on non-separable, ill-conditioned problems by orders of magnitude.
Document type :
Conference papers
Parallel Problem Solving from Nature - PPSN X, Sep 2008, Dortmund, Germany. pp.205-214, 2008


https://hal.inria.fr/inria-00287351
Contributor : Nikolaus Hansen <>
Submitted on : Monday, June 23, 2008 - 5:58:09 PM
Last modification on : Tuesday, September 23, 2008 - 4:59:55 PM

File

ppsn2008.pdf
fileSource_public_greenPublisher

Identifiers

  • HAL Id : inria-00287351, version 3

Collections

Citation

Nikolaus Hansen. Adaptive Encoding: How to Render Search Coordinate System Invariant. Parallel Problem Solving from Nature - PPSN X, Sep 2008, Dortmund, Germany. pp.205-214, 2008. <inria-00287351v3>

Export

Share

Metrics

Consultation de
la notice

327

Téléchargement du document

136