LS-CMA-ES: A second-order algorithm for covariance matrix adaptation

Anne Auger, Marc Schoenauer, Nicolas Vanhaecke

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

Evolution Strategies, a class of Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimization is concerned. However, there are multiple ways to tune the covariance matrix of the Gaussian mutation. After reviewing the state of the art in covariance matrix adaptation, a new approach is proposed, in which the update of the covariance matrix is based on a quadratic approximation of the target function, obtained by some Least-Square minimization. A dynamic criterion is designed to detect situations where the approximation is not accurate enough, and original Covariance Matrix Adaptation (CMA) should rather be directly used. The resulting algorithm is experimentally validated on benchmark functions, outperforming CMA-ES on a large class of problems.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
EditorsXin Yao, John A. Bullinaria, Jonathan Rowe, Peter Tino, Ata Kaban, Edmund Burke, Jose A. Lozano, Jim Smith, Juan J. Merelo-Guervos, Hans-Paul Schwefel
PublisherSpringer Verlag
Pages182-191
Number of pages10
ISBN (Print)3540230920, 9783540230922
DOIs
Publication statusPublished - 1 Jan 2004
Externally publishedYes

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3242
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Fingerprint

Dive into the research topics of 'LS-CMA-ES: A second-order algorithm for covariance matrix adaptation'. Together they form a unique fingerprint.

Cite this