Increasing the Serial and the Parallel Performance of the CMA-Evolution Strategy with Large Populations
The derandomized evolution strategy (ES) with covariance matrix adaptation (CMA), is modified with the goal to speed up the algorithm in terms of needed number of generations. The idea of the modification of the algorithm is to adapt the covariance matrix in a faster way than in the original version by using a larger amount of the information contained in large populations. The original version of the CMA was designed to reliably adapt the covariance matrix in small populations and turned out to be highly efficient in this case. The modification scales up the efficiency to population sizes of up to 10n, where n ist the problem dimension. If enough processors are available, the use of large populations and thus of evaluating a large number of search points per generation is not a problem since the algorithm can be easily parallelized.
KeywordsCovariance Matrix Parallel Performance Adaptation Time Search Point Serial Performance
Unable to display preview. Download preview PDF.
- Bäck et al., 1997.
- Hansen, 1998.Hansen, N. (1998). Verallgemeinerte individuelle Schrittweitenregelung in der Evolutionsstrategie. Eine Untersuchung zur entstochastisierten, koordinatensystemunabhängigen Adaptation der Mutationsverteilung. Mensch und Buch Verlag, Berlin. ISBN 3-933346-29-0.Google Scholar
- Hansen and Ostermeier,1997.Hansen, N. and Ostermeier, A. (1997). Convergence properties of evolution strategies with the derandomized covariance matrix adaptation: The (μ/μI, λ)-CMA-ES. In Zimmermann, H.-J., editor, EUFIT’97, 5th Europ. Congr. on Intelligent Techniques and Soft Computing, Proceedings, pages 650–654, Aachen, Germany. Verlag Mainz.Google Scholar
- Hansen and Ostermeier, 2001.
- Schwefel, 1995.Schwefel, H.-P. (1995). Evolution and Optimum Seeking. Sixth-Generation Computer Technology Series. John Wiley & Sons Inc., New York.Google Scholar