Averaging Efficiently in the Presence of Noise
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Creating Robust Solutions by Means of Evolutionary Algorithms
PPSN V Proceedings of the 5th International Conference on Parallel Problem Solving from Nature
Advances in evolutionary computing
Completely Derandomized Self-Adaptation in Evolution Strategies
Evolutionary Computation
Scheduling of genetic algorithms in a noisy environment
Evolutionary Computation
Why noise may be good: additive noise on the sharp ridge
Proceedings of the 10th annual conference on Genetic and evolutionary computation
Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search
ICML '09 Proceedings of the 26th Annual International Conference on Machine Learning
Uncertainty handling CMA-ES for reinforcement learning
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
On the limitations of adaptive resampling in using the student's t-test evolution strategies
Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
IEEE Transactions on Evolutionary Computation - Special issue on computational finance and economics
Adaptive niche radii and niche shapes approaches for niching with the cma-es
Evolutionary Computation
Exploiting overlap when searching for robust optima
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
An archive maintenance scheme for finding robust solutions
PPSN'10 Proceedings of the 11th international conference on Parallel problem solving from nature: Part I
Genetic algorithms with a robust solution searching scheme
IEEE Transactions on Evolutionary Computation
Robust design of multilayer optical coatings by means ofevolutionary algorithms
IEEE Transactions on Evolutionary Computation
Evolutionary optimization in uncertain environments-a survey
IEEE Transactions on Evolutionary Computation
Max-min surrogate-assisted evolutionary algorithm for robust design
IEEE Transactions on Evolutionary Computation
Efficient search for robust solutions by means of evolutionary algorithms and fitness approximation
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
| Hi-index | 0.00 |
Algorithms that search for robust optima often evaluate the effective fitness (robust fitness) based on stochastic approximation schemes. In this setting, finding robust optima can be recast as an optimization problem with an/a uncertain/noisy objective function. This paper studies whether state-of-the-art uncertainty handling techniques, proposed in the context of optimizing noisy objective functions, can be applied for finding robust optima. In this paper, the UH-CMA-ES is modified to handle approximations of the effective fitness. This modified approach, named RO-UH-CMA-ES, is evaluated empirically and compared to other schemes that aim to find robust optima. The experiments on multiple benchmark problems show that the RO-UH-CMA-ES yields comparable results for multi-modal problems and it outperforms other schemes on unimodal problems.