Skip to Main content Skip to Navigation
Conference papers

Adaptive Encoding: How to Render Search Coordinate System Invariant

Nikolaus Hansen 1, 2, *
* Corresponding author
2 TAO - Machine Learning and Optimisation
CNRS - Centre National de la Recherche Scientifique : UMR8623, Inria Saclay - Ile de France, UP11 - Université Paris-Sud - Paris 11, LRI - Laboratoire de Recherche en Informatique
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
Complete list of metadata

Cited literature [9 references]  Display  Hide  Download
Contributor : Nikolaus Hansen Connect in order to contact the contributor
Submitted on : Monday, June 23, 2008 - 5:58:09 PM
Last modification on : Thursday, January 20, 2022 - 5:29:21 PM
Long-term archiving on: : Thursday, September 23, 2010 - 4:50:54 PM


Publisher files allowed on an open archive


  • HAL Id : inria-00287351, version 3


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. ⟨inria-00287351v3⟩



Record views


Files downloads