Exponential slowdown for larger populations: The (μ + 1)-EA on monotone functions
Metadata only
Date
2021-07-06Type
- Journal Article
Abstract
Pseudo-Boolean monotone functions are unimodal functions which are trivial to optimize for some hillclimbers, but are challenging for a surprising number of evolutionary algorithms. A general trend is that evolutionary algorithms are efficient if parameters like the mutation rate are set conservatively, but may need exponential time otherwise. In particular, it was known that the (1+1)-EA and the (1+λ)-EA can optimize every monotone function in pseudolinear time if the mutation rate is c/n for some c<1, but that they need exponential time for some monotone functions for c>2.2. The second part of the statement was also known for the (μ+1)-EA.
In this paper we show that the first statement does not apply to the (μ+1)-EA. More precisely, we prove that for every constant c>0 there is a constant μ0∈N such that the (μ+1)-EA with mutation rate c/n and population size μ0≤μ≤n needs superpolynomial time to optimize some monotone functions. Thus, increasing the population size by just a constant has devastating effects on the performance. This is in stark contrast to many other benchmark functions on which increasing the population size either increases the performance significantly, or affects performance only mildly.
The reason why larger populations are harmful lies in the fact that larger populations may temporarily decrease the selective pressure on parts of the population. This allows unfavorable mutations to accumulate in single individuals and their descendants. If the population moves sufficiently fast through the search space, then such unfavorable descendants can become ancestors of future generations, and the bad mutations are preserved. Remarkably, this effect only occurs if the population renews itself sufficiently fast, which can only happen far away from the optimum. This is counter-intuitive since usually optimization becomes harder as we approach the optimum. Previous work missed the effect because it focused on monotone functions that are only deceptive close to the optimum. Show more
Publication status
publishedExternal links
Journal / series
Theoretical Computer ScienceVolume
Pages / Article No.
Publisher
ElsevierSubject
Evolutionary algorithm; monotone functions; population size; mutation rate; runtime analysis; hottopic functionsOrganisational unit
03672 - Steger, Angelika / Steger, Angelika
More
Show all metadata