Simplify Your Covariance Matrix Adaptation Evolution Strategy

• Published in: IEEE transactions on evolutionary computation Vol. 21; no. 5; pp. 746 - 759
• Main Authors: Beyer, Hans-Georg, Sendhoff, Bernhard
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.10.2017; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: Adaptation; Algorithm design and analysis; Black box optimization benchmarking; Covariance matrices; Covariance matrix; Evolutionary algorithms; Matrix; matrix adaptation evolution strategies (MA-ES); Matrix decomposition; Optimization; Sociology
• ISSN: 1089-778X; 1941-0026
• DOI: 10.1109/TEVC.2017.2680320

The standard covariance matrix adaptation evolution strategy (CMA-ES) comprises two evolution paths, one for the learning of the mutation strength and one for the rank-1 update of the covariance matrix. In this paper, it is shown that one can approximately transform this algorithm in such a manner that one of the evolution paths and the covariance matrix itself disappear. That is, the covariance update and the covariance matrix square root operations are no longer needed in this novel so-called matrix adaptation (MA) ES. The MA-ES performs nearly as well as the original CMA-ES. This is shown by empirical investigations considering the evolution dynamics and the empirical expected runtime on a set of standard test functions. Furthermore, it is shown that the MA-ES can be used as a search engine in a bi-population (BiPop) ES. The resulting BiPop-MA-ES is benchmarked using the BBOB comparing continuous optimizers (COCO) framework and compared with the performance of the CMA-ES-v3.61 production code. It is shown that this new BiPop-MA-ES-while algorithmically simpler-performs nearly equally well as the CMA-ES-v3.61 code.