Comparison of cauchy EDA and pPOEMS algorithms on the BBOB noiseless testbed

Authors:
Petr Pošík;Jiří Kubalik
Affiliations:
Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Rep;Czech Technical University in Prague, Faculty of Electrical Engineering, Prague, Czech Rep
Venue:
Proceedings of the 12th annual conference companion on Genetic and evolutionary computation
Year:
2010

Citing 4
Cited 0

Solving the sorting network problem using iterative optimization with evolved hypermutations

Proceedings of the 11th Annual conference on Genetic and evolutionary computation
Black-box optimization benchmarking of prototype optimization with evolved improvement steps for noiseless function testbed

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
BBOB-benchmarking a simple estimation of distribution algorithm with cauchy distribution

Proceedings of the 11th Annual Conference Companion on Genetic and Evolutionary Computation Conference: Late Breaking Papers
Efficient stochastic local search algorithm for solving the shortest common supersequence problem

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

Quantified Score

Hi-index	0.00

Visualization

Abstract

Estimation-of-distribution algorithm using Cauchy sampling distribution is compared with the iterative prototype optimization algorithm with evolved improvement steps. While Cauchy EDA is better on unimodal functions, iterative prototype optimization is more suitable for multimodal functions. This paper compares the results for both algorithms in more detail and adds to the understanding of their key features and differences.