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. © 2008 Springer-Verlag Berlin Heidelberg.
CITATION STYLE
Hansen, N. (2008). Adaptive encoding: how to render search coordinate system invariant. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5199 LNCS, pp. 205–214). https://doi.org/10.1007/978-3-540-87700-4_21
Mendeley helps you to discover research relevant for your work.