LS-CMA-ES: A Second-Order Algorithm for Covariance Matrix Adaptation

Abstract. Evolution Strategies, 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 covariance matrix adaptation method 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, performing much better than CMA-ES on a large class of problems.

• Type: Conference
• Year: 2004
• Where: PPSN
• Authors: Anne Auger, Marc Schoenauer, Nicolas Vanhaecke
• Keywords: Covariance Matrix, Covariance Matrix Adaptation, Distributed And Parallel Computing, Gaussian Mutation, PPSN 2004