The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax

The (1+λ) EA with mutation probability c/n, where c > 0 is an arbitrary constant, is studied for the classical OneMax function. Its expected optimization time is analyzed exactly (up to lower order terms) as a function of c and λ. It turns out that 1/n is the only optimal mutation probability if λ = o(lnn ln lnn/ln ln lnn), which is the cut-off point for linear speed-up. However, if λ is above this cut-off point then the standard mutation probability 1/n is no longer the only optimal choice. Instead, the expected number of generations is (up to lower order terms) independent of c, irrespectively of it being less than 1 or greater. The theoretical results are obtained by a careful study of order statistics of the binomial distribution and variable drift theorems for upper and lower bounds. Experimental supplements shed light on the optimal mutation probability for small problem sizes.

[1]  Carsten Witt,et al.  Runtime Analysis of the ( μ +1) EA on Simple Pseudo-Boolean Functions , 2006 .

[2]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2010, GECCO '12.

[3]  Dirk Sudholt,et al.  The choice of the offspring population size in the (1, λ) evolutionary algorithm , 2014, Theor. Comput. Sci..

[4]  Frank Neumann,et al.  Bioinspired computation in combinatorial optimization: algorithms and their computational complexity , 2012, GECCO '12.

[5]  Dirk Sudholt,et al.  Crossover speeds up building-block assembly , 2012, GECCO '12.

[6]  Dirk Sudholt,et al.  A New Method for Lower Bounds on the Running Time of Evolutionary Algorithms , 2011, IEEE Transactions on Evolutionary Computation.

[7]  Jens Jägersküpper,et al.  Combining Markov-Chain Analysis and Drift Analysis , 2011, Algorithmica.

[8]  Enrique Alba,et al.  Fitness Probability Distribution of Bit-Flip Mutation , 2013, Evolutionary Computation.

[9]  Jonathan E. Rowe,et al.  Theoretical analysis of local search strategies to optimize network communication subject to preserving the total number of links , 2009, Int. J. Intell. Comput. Cybern..

[10]  Frank Neumann,et al.  Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem , 2010, PPSN.

[11]  Per Kristian Lehre,et al.  Unbiased Black-Box Complexity of Parallel Search , 2014, PPSN.

[12]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms: The Computer Science Perspective , 2012 .

[13]  Marvin Künnemann,et al.  Optimizing linear functions with the (1+λ) evolutionary algorithm - Different asymptotic runtimes for different instances , 2015, Theor. Comput. Sci..

[14]  Marvin Künnemann,et al.  Royal road functions and the (1 + λ) evolutionary algorithm: Almost no speed-up from larger offspring populations , 2013, 2013 IEEE Congress on Evolutionary Computation.

[15]  Benjamin Doerr,et al.  Multiplicative Drift Analysis , 2010, GECCO '10.

[16]  Carsten Witt,et al.  Tight Bounds on the Optimization Time of a Randomized Search Heuristic on Linear Functions† , 2013, Combinatorics, Probability and Computing.

[17]  Carsten Witt,et al.  Population Size vs. Mutation Strength for the (1+λ) EA on OneMax , 2015, GECCO.

[18]  Carsten Witt,et al.  Runtime Analysis of the ( + 1) EA on Simple Pseudo-Boolean Functions , 2006, Evolutionary Computation.

[19]  Leslie Ann Goldberg,et al.  Adaptive Drift Analysis , 2011, Algorithmica.

[20]  Mahmoud Fouz,et al.  Sharp bounds by probability-generating functions and variable drift , 2011, GECCO '11.

[21]  Anne Auger,et al.  Theory of Randomized Search Heuristics: Foundations and Recent Developments , 2011, Theory of Randomized Search Heuristics.

[22]  Per Kristian Lehre,et al.  Concentrated Hitting Times of Randomized Search Heuristics with Variable Drift , 2014, ISAAC.

[23]  Mahmoud Fouz,et al.  Quasirandom evolutionary algorithms , 2010, GECCO '10.

[24]  Kenneth A. De Jong,et al.  Design and Management of Complex Technical Processes and Systems by Means of Computational Intelligence Methods on the Choice of the Offspring Population Size in Evolutionary Algorithms on the Choice of the Offspring Population Size in Evolutionary Algorithms , 2004 .

[25]  Daniel Johannsen,et al.  Random combinatorial structures and randomized search heuristics , 2010 .