Comparing the niches of CMA-ES, CHC and pattern search using diverse benchmarks

Authors:
Darrell Whitley;Monte Lunacek;Artem Sokolov
Affiliations:
Computer Science, Colorado State University, Fort Collins, CO;Computer Science, Colorado State University, Fort Collins, CO;Computer Science, Colorado State University, Fort Collins, CO
Venue:
PPSN'06 Proceedings of the 9th international conference on Parallel Problem Solving from Nature
Year:
2006

Citing 6
Cited 2

Evaluating evolutionary algorithms

Artificial Intelligence - Special volume on empirical methods
On the Convergence of Pattern Search Algorithms

SIAM Journal on Optimization
Completely Derandomized Self-Adaptation in Evolution Strategies

Evolutionary Computation
Mesh Adaptive Direct Search Algorithms for Constrained Optimization

SIAM Journal on Optimization
The dispersion metric and the CMA evolution strategy

Proceedings of the 8th annual conference on Genetic and evolutionary computation
Predictive models for the breeder genetic algorithm i. continuous parameter optimization

Evolutionary Computation

Center of mass encoding: a self-adaptive representation with adjustable redundancy for real-valued parameters

Proceedings of the 9th annual conference on Genetic and evolutionary computation
Efficient covariance matrix update for variable metric evolution strategies

Machine Learning

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper explores two questions: 1) On a relatively difficult and varied set of test problems, can we observe differences in evolutionary search algorithm performance related to problem features? 2) How do the evolutionary algorithms compare to Pattern Search algorithms, a more traditional optimization tool popular in the larger scientific community? The results suggest there are consistent differences in algorithm performance that can be related back to problem features. Some new ideas for the construction of benchmark problems are also introduced.