Exploiting overlap when searching for robust optima

Authors:
Johannes Kruisselbrink;Michael Emmerich;André Deutz;Thomas Bäck
Affiliations:
LIACS, Leiden University, Leiden;LIACS, Leiden University, Leiden;LIACS, Leiden University, Leiden;LIACS, Leiden University, Leiden
Venue:
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Year:
2010

Citing 7
Cited 1

Evolution and Optimum Seeking: The Sixth Generation

Evolution and Optimum Seeking: The Sixth Generation
Creating Robust Solutions by Means of Evolutionary Algorithms

PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Effects of adding perturbations to phenotypic parameters in genetic algorithms for searching robust solutions

Advances in evolutionary computing
Toward a theory of evolution strategies: Some asymptotical results from the (1,+ λ)-theory

Evolutionary Computation
Genetic algorithms with a robust solution searching scheme

IEEE Transactions on Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey

IEEE Transactions on Evolutionary Computation
Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation

IEEE Transactions on Evolutionary Computation

Using the uncertainty handling CMA-ES for finding robust optima

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a new view on fitness evaluation when searching for robust optima. It proposes to compare solutions in (successive) populations with respect to how they rank in robustness instead of aiming for accurate robustness estimates. This can be done by focusing on the non-overlapping parts of the regions of uncertainty of each pair of candidate solutions. An initial step toward a scheme implementing this view is made with the analysis and experiments on a simple scenario comparing two solutions on uniform input noise.