Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES).
This paper presents a novel evolutionary optimization strategy based on the derandomized evolution strategy with covariance matrix adaptation (CMA-ES). This new approach is intended to reduce the number of generations required for convergence to the optimum. Reducing the number of generations, i.e., the time complexity of the algorithm, is important if a large population size is desired: (1) to reduce the effect of noise; (2) to improve global search properties; and (3) to implement the algorithm on (highly) parallel machines. Our method results in a highly parallel algorithm which scales favorably with large numbers of processors. This is accomplished by efficiently incorporating the available information from a large population, thus significantly reducing the number of generations needed to adapt the covariance matrix. The original version of the CMA-ES was designed to reliably adapt the covariance matrix in small populations but it cannot exploit large populations efficiently. Our modifications scale up the efficiency to population sizes of up to 10n, where n is the problem dimension. This method has been applied to a large number of test problems, demonstrating that in many cases the CMA-ES can be advanced from quadratic to linear time complexity.
Hansen
Nikolaus
N
Fachgebiet für Bionik, Technische Universität Berlin, Ackerstr. 71-76, 13355 Berlin, Germany. hansen@bionik.tu-berlin.de
Müller
Sibylle D
SD
Koumoutsakos
Petros
P
D000465:Algorithms; D005075:Biological Evolution; D003198:Computer Simulation; D008957:Models, Genetic; D015233:Models, Statistical; D011156:Population Density; D013997:Time Factors