Fitness Probability Distribution of Bit-Flip Mutation

Bit-flip mutation is a common mutation operator for evolutionary algorithms applied to optimize functions over binary strings. In this paper, we develop results from the theory of landscapes and Krawtchouk polynomials to exactly compute the probability distribution of fitness values of a binary string undergoing uniform bit-flip mutation. We prove that this probability distribution can be expressed as a polynomial in p, the probability of flipping each bit. We analyze these polynomials and provide closed-form expressions for an easy linear problem (Onemax), and an NP-hard problem, MAX-SAT. We also discuss a connection of the results with runtime analysis.

[1]  Enrique Alba,et al.  Exact computation of the expectation surfaces for uniform crossover along with bit-flip mutation , 2014, Theor. Comput. Sci..

[2]  Christian M. Reidys,et al.  Combinatorial Landscapes , 2002, SIAM Rev..

[3]  Peter F. Stadler,et al.  Laplacian Eigenvectors of Graphs , 2007 .

[4]  Enrique Alba,et al.  A Methodology to Find the Elementary Landscape Decomposition of Combinatorial Optimization Problems , 2011, Evolutionary Computation.

[5]  Peter F. Stadler,et al.  Towards a theory of landscapes , 1995 .

[6]  Enrique Alba,et al.  Exact computation of the expectation curves of the bit-flip mutation using landscapes theory , 2011, GECCO '11.

[7]  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 .

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

[9]  Xin Yao,et al.  Towards an analytic framework for analysing the computation time of evolutionary algorithms , 2003, Artif. Intell..

[10]  Lov K. Grover.  Local search and the local structure of NP-complete problems , 1992, Oper. Res. Lett..

[11]  L. Mirsky,et al.  An introduction to linear algebra , 1957, Mathematical Gazette.

[12]  Carsten Witt,et al.  Bioinspired Computation in Combinatorial Optimization , 2010, Bioinspired Computation in Combinatorial Optimization.

[13]  A. Terras.  Fourier Analysis on Finite Groups and Applications: Index , 1999 .

[14]  Andrew M. Sutton,et al.  A polynomial time computation of the exact correlation structure of k-satisfiability landscapes , 2009, GECCO '09.

[15]  J. Leydold,et al.  Laplacian eigenvectors of graphs : Perron-Frobenius and Faber-Krahn type theorems , 2007 .

[16]  Andrew M. Sutton,et al.  Approximating the distribution of fitness over hamming regions , 2011, FOGA '11.

[17]  Andrew M. Sutton,et al.  Mutation rates of the (1+1)-EA on pseudo-boolean functions of bounded epistasis , 2011, GECCO '11.

[18]  Marvin Künnemann,et al.  How the (1+λ) evolutionary algorithm optimizes linear functions , 2013, GECCO '13.

[19]  Andrew M. Sutton,et al.  Computing the moments of k-bounded pseudo-Boolean functions over Hamming spheres of arbitrary radius in polynomial time , 2012, Theor. Comput. Sci..

[20]  Enrique Alba,et al.  Exact computation of the expectation curves for uniform crossover , 2012, GECCO '12.

[21]  Andrew M. Sutton,et al.  Partial neighborhoods of elementary landscapes , 2009, GECCO '09.

[22]  Michael D. Vose,et al.  The simple genetic algorithm - foundations and theory , 1999, Complex adaptive systems.

[23]  Marc Schoenauer,et al.  Rigorous Hitting Times for Binary Mutations , 1999, Evolutionary Computation.

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

[25]  Jerzy Kocik,et al.  Krawtchouk Polynomials and Krawtchouk Matrices , 2007, quant-ph/0702073.

[26]  J. Walsh.  A Closed Set of Normal Orthogonal Functions , 1923 .

[27]  D. Cooke,et al.  Finite Markov Processes and Their Applications , 1981 .

[28]  H. Waelbroeck,et al.  Complex Systems and Binary Networks , 1995 .

[29]  Andrew M. Sutton,et al.  Directed Plateau Search for MAX-k-SAT , 2010, SOCS.

[30]  Andrew M. Sutton,et al.  Understanding elementary landscapes , 2008, GECCO '08.