DocumentCode
2689358
Title
Self-Adaptive Niching CMA-ES with Mahalanobis Metric
Author
Shir, Ofer M. ; Emmerich, Michael ; Bäck, Thomas
Author_Institution
Leiden Univ., Leiden
fYear
2007
fDate
25-28 Sept. 2007
Firstpage
820
Lastpage
827
Abstract
Existing niching techniques commonly use the Euclidean distance metric in the decision space for the classification of feasible solutions to the niches under formation. This approach is likely to encounter problems in high-dimensional landscapes with non-isotropic basins of attraction. Here we consider niching with the covariance matrix adaptation evolution strategy (CMA-ES), and introduce the Mahalanobis distance metric into the niching mechanism, aiming to allow a more accurate spatial classification, based on the ellipsoids of the distribution, rather than hyper-spheres of the Euclidean metric. This is tested with the CMA-(+) routines, and compared to two niching frameworks - fixed niche radius as well as self- adaptive niche radius, which is based on the coupling to the step-size. The performance of the different variants is evaluated on a suite of theoretical test-functions. We thus present here the Mahalanobis-assisted CMA-niching as a state-of-the-art niching technique within evolution strategies (ES), and propose it as a solution to the so-called niche radius problem.
Keywords
covariance matrices; evolutionary computation; Euclidean metric; Mahalanobis metric; covariance matrix adaptation evolution strategy; niche radius problem; self-adaptive niching; Automatic testing; Covariance matrix; Ellipsoids; Euclidean distance; Evolution (biology); Evolutionary computation; Optimization methods; Performance analysis; Physics; Stochastic processes;
fLanguage
English
Publisher
ieee
Conference_Titel
Evolutionary Computation, 2007. CEC 2007. IEEE Congress on
Conference_Location
Singapore
Print_ISBN
978-1-4244-1339-3
Electronic_ISBN
978-1-4244-1340-9
Type
conf
DOI
10.1109/CEC.2007.4424555
Filename
4424555
Link To Document