Robustness of Populations in Stochastic Environments

We consider stochastic versions of ONEMAX and LEADINGONES and analyze the performance of evolutionary algorithms with and without populations on these problems. It is known that the (1+ 1) EA on ONEMAX performs well in the presence of very small noise, but poorly for higher noise levels. We extend these results to LEADINGONES and to many different noise models, showing howthe application of drift theory can significantly simplify and generalize previous analyses. Most surprisingly, even small populations (of size Theta (log n)) can make evolutionary algorithms perform well for high noise levels, well outside the abilities of the (1 + 1) EA. Larger population sizes are even more beneficial; we consider both parent and offspring populations. In this sense, populations are robust in these stochastic settings.