Model-guided Evolution Strategies for Dynamically Balancing Exploration and Exploitation

Wide exploration of high-dimensional, multimodal design spaces is required for uncovering alternative solutions in the conceptual phase of design optimization tasks. We present a general framework for balancing exploration and exploitation during the course of the optimization that induces sequential exploitation of different optima in the search space by selecting on a solution’s fitness and a dynamic criterion termed interestingness. We use a fitness approximation model as a memory representing the parts of the search space that have been visited before. It guides the optimizer toward those areas that require additional sampling to be correctly modeled, and are hence termed interesting. Next to applying the prediction error of the model as a measure of interestingness, we consider the statistical variation in the predictions made by multiple parallel models as an alternative approach to quantify interestingness. On three artificial test functions we compare these setups running on a canonical ES to the same ES extended with either archive-based novelty, niching, or restarting, and to simply evaluating a Latin Hypercube set of sample points.

[1]  E. Zechman Niched Co-Evolution Strategies to Address Non-uniqueness in Engineering Design , 2006 .

[2]  Donald R. Jones,et al.  Efficient Global Optimization of Expensive Black-Box Functions , 1998, J. Glob. Optim..

[3]  Ofer M. Shir,et al.  Adaptive Niche Radii and Niche Shapes Approaches for Niching with the CMA-ES , 2010, Evolutionary Computation.

[4]  Markus Olhofer,et al.  Towards Directed Open-Ended Search by a Novelty Guided Evolution Strategy , 2010, PPSN.

[5]  Thomas Bäck,et al.  Evolutionary algorithms in theory and practice - evolution strategies, evolutionary programming, genetic algorithms , 1996 .

[6]  Christian Igel,et al.  Empirical evaluation of the improved Rprop learning algorithms , 2003, Neurocomputing.

[7]  Richard J. Beckman,et al.  A Comparison of Three Methods for Selecting Values of Input Variables in the Analysis of Output From a Computer Code , 2000, Technometrics.

[8]  Yaochu Jin,et al.  A comprehensive survey of fitness approximation in evolutionary computation , 2005, Soft Comput..

[9]  Jean-Baptiste Mouret Novelty-Based Multiobjectivization , 2011 .

[10]  Witold Pedrycz,et al.  Hybrid optimization with improved tabu search , 2011, Applied Soft Computing.

[11]  Kalyanmoy Deb,et al.  A fast and elitist multiobjective genetic algorithm: NSGA-II , 2002, IEEE Trans. Evol. Comput..

[12]  Hans-Paul Schwefel,et al.  Evolution and Optimum Seeking: The Sixth Generation , 1993 .

[13]  Kalyanmoy Deb,et al.  A Bi-criterion Approach to Multimodal Optimization: Self-adaptive Approach , 2010, SEAL.

[14]  Michael J. Shaw,et al.  Genetic algorithms with dynamic niche sharing for multimodal function optimization , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[15]  Nikolaus Hansen,et al.  A restart CMA evolution strategy with increasing population size , 2005, 2005 IEEE Congress on Evolutionary Computation.

[16]  Mike Preuss,et al.  Niching the CMA-ES via nearest-better clustering , 2010, GECCO '10.

[17]  Kenneth O. Stanley,et al.  Exploiting Open-Endedness to Solve Problems Through the Search for Novelty , 2008, ALIFE.

[18]  Faustino J. Gomez,et al.  Novelty-based restarts for evolution strategies , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).