Theory for non-theoreticians: tutorial

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the owner/author(s). GECCO '18 Companion, July 15–19, 2018, Kyoto, Japan © 2018 Copyright is held by the owner/author(s). ACM ISBN 978-1-4503-5764-7/18/07. https://doi.org/10.1145/3205651.3207889 Benjamin Doerr: Theory of Evolutionary Computation Instructor: Benjamin Doerr

[1]  Ingo Wegener,et al.  Real royal road functions--where crossover provably is essential , 2001, Discret. Appl. Math..

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

[3]  Benjamin Doerr,et al.  Playing Mastermind with Many Colors , 2013, SODA.

[4]  Stefan Droste,et al.  Analysis of the (1+1) EA for a dynamically changing ONEMAX-variant , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[5]  Timo Kötzing,et al.  ACO Beats EA on a Dynamic Pseudo-Boolean Function , 2012, PPSN.

[6]  Benjamin Doerr,et al.  A tight runtime analysis for the (μ + λ) EA , 2018, GECCO.

[7]  Kalyanmoy Deb,et al.  Long Path Problems , 1994, PPSN.

[8]  Benjamin Doerr,et al.  Fast genetic algorithms , 2017, GECCO.

[9]  Thomas Jansen,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods On the Choice of the Mutation Probability for the ( 1 + 1 ) EA , 2006 .

[10]  H. Szu.  Fast simulated annealing , 1987 .

[11]  Pietro Simone Oliveto,et al.  Improved time complexity analysis of the Simple Genetic Algorithm , 2015, Theor. Comput. Sci..

[12]  Dirk Sudholt,et al.  Adaptive population models for offspring populations and parallel evolutionary algorithms , 2011, FOGA '11.

[13]  Thomas Jansen,et al.  On the analysis of the (1+1) evolutionary algorithm , 2002, Theor. Comput. Sci..

[14]  Benjamin Doerr,et al.  Optimal Parameter Choices Through Self-Adjustment: Applying the 1/5-th Rule in Discrete Settings , 2015, GECCO.

[15]  Carsten Witt,et al.  Runtime analysis of ant colony optimization on dynamic shortest path problems , 2013, GECCO '13.

[16]  Heinz Mühlenbein,et al.  How Genetic Algorithms Really Work: Mutation and Hillclimbing , 1992, PPSN.

[17]  Ingo Wegener,et al.  The analysis of evolutionary algorithms on sorting and shortest paths problems , 2004, J. Math. Model. Algorithms.

[18]  Pietro Simone Oliveto,et al.  Analysis of diversity mechanisms for optimisation in dynamic environments with low frequencies of change , 2013, GECCO '13.

[19]  Ingo Wegener,et al.  A Rigorous Complexity Analysis of the (1 + 1) Evolutionary Algorithm for Separable Functions with Boolean Inputs , 1998, Evolutionary Computation.

[20]  Petr Posík,et al.  Comparison of cauchy EDA and BIPOP-CMA-ES algorithms on the BBOB noiseless testbed , 2010, GECCO '10.

[21]  Pietro Simone Oliveto,et al.  Theoretical analysis of fitness-proportional selection: landscapes and efficiency , 2009, GECCO.

[22]  Benjamin Doerr,et al.  Money for Nothing: Speeding Up Evolutionary Algorithms Through Better Initialization , 2015, GECCO.

[23]  Benjamin Doerr,et al.  Optimal Static and Self-Adjusting Parameter Choices for the (1+(λ,λ))\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$( , 2017, Algorithmica.

[24]  Anne Auger,et al.  Theory of Randomized Search Heuristics , 2012, Algorithmica.

[25]  Ingo Wegener,et al.  The Ising Model on the Ring: Mutation Versus Recombination , 2004, GECCO.

[26]  Thomas Jansen,et al.  On the analysis of a dynamic evolutionary algorithm , 2006, J. Discrete Algorithms.

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

[28]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[29]  Benjamin Doerr,et al.  Runtime analysis of the (1 + (λ, λ)) genetic algorithm on random satisfiable 3-CNF formulas , 2017, GECCO.

[30]  Benjamin Doerr,et al.  Crossover can provably be useful in evolutionary computation , 2008, GECCO '08.

[31]  Mark Hoogendoorn,et al.  Parameter Control in Evolutionary Algorithms: Trends and Challenges , 2015, IEEE Transactions on Evolutionary Computation.

[32]  Thomas Jansen,et al.  Theoretical analysis of a mutation-based evolutionary algorithm for a tracking problem in the lattice , 2005, GECCO '05.

[33]  Benjamin Doerr,et al.  Runtime Analysis for Self-adaptive Mutation Rates , 2018, Algorithmica.

[34]  Pietro Simone Oliveto,et al.  On the runtime analysis of selection hyper-heuristics with adaptive learning periods , 2018, GECCO.

[35]  Per Kristian Lehre,et al.  Runtime analysis of selection hyper-heuristics with classical learning mechanisms , 2014, 2014 IEEE Congress on Evolutionary Computation (CEC).

[36]  Carola Doerr,et al.  Elitist Black-Box Models: Analyzing the Impact of Elitist Selection on the Performance of Evolutionary Algorithms , 2015, GECCO.

[37]  Benjamin Doerr,et al.  Edge-based representation beats vertex-based representation in shortest path problems , 2010, GECCO '10.

[38]  Stephen R. Marsland,et al.  Convergence Properties of (μ + λ) Evolutionary Algorithms , 2011, AAAI.

[39]  Anne Auger,et al.  When Do Heavy-Tail Distributions Help? , 2006, PPSN.

[40]  Jens Jägersküpper,et al.  A Blend of Markov-Chain and Drift Analysis , 2008, PPSN.

[41]  Melanie Mitchell,et al.  Relative Building-Block Fitness and the Building Block Hypothesis , 1992, FOGA.

[42]  Benjamin Doerr,et al.  The (1+λ) evolutionary algorithm with self-adjusting mutation rate , 2017, GECCO.

[43]  Pietro Simone Oliveto,et al.  On the runtime analysis of generalised selection hyper-heuristics for pseudo-boolean optimisation , 2017, GECCO.

[44]  Benjamin Doerr,et al.  From black-box complexity to designing new genetic algorithms , 2015, Theor. Comput. Sci..

[45]  Benjamin Doerr,et al.  Faster Evolutionary Algorithms by Superior Graph Representation , 2007, 2007 IEEE Symposium on Foundations of Computational Intelligence.

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

[47]  Pietro Simone Oliveto,et al.  Analysis of the $(1+1)$-EA for Finding Approximate Solutions to Vertex Cover Problems , 2009, IEEE Transactions on Evolutionary Computation.

[48]  Xin Yao,et al.  Drift analysis and average time complexity of evolutionary algorithms , 2001, Artif. Intell..

[49]  Benjamin Doerr,et al.  A Tight Runtime Analysis of the (1+(λ, λ)) Genetic Algorithm on OneMax , 2015, GECCO.

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

[51]  Benjamin Doerr,et al.  Unbiased black-box complexities of jump functions: how to cross large plateaus , 2014, GECCO.

[52]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms Through Restricted Mutation Operators , 2006, PPSN.

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

[54]  Dirk Sudholt,et al.  When do evolutionary algorithms optimize separable functions in parallel? , 2013, FOGA XII '13.

[55]  Dirk Sudholt,et al.  First Steps Towards a Runtime Comparison of Natural and Artificial Evolution , 2015, GECCO.

[56]  John H. Holland,et al.  Adaptation in Natural and Artificial Systems: An Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence , 1992 .

[57]  William F. Punch,et al.  Parameter-less population pyramid , 2014, GECCO.

[58]  Benjamin Doerr,et al.  A tight analysis of the (1 + 1)-EA for the single source shortest path problem , 2007, IEEE Congress on Evolutionary Computation.

[59]  Benjamin Doerr,et al.  Optimal Parameter Settings for the (1 + λ, λ) Genetic Algorithm , 2016, GECCO.

[60]  Thomas Jansen,et al.  Analyzing Evolutionary Algorithms , 2015, Natural Computing Series.

[61]  Benjamin Doerr,et al.  Reducing the arity in unbiased black-box complexity , 2014, Theor. Comput. Sci..

[62]  Thomas Jansen,et al.  On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help , 1999 .

[63]  Frank Neumann.  Expected runtimes of evolutionary algorithms for the Eulerian cycle problem , 2004, IEEE Congress on Evolutionary Computation.

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

[65]  Carsten Witt,et al.  Revised analysis of the (1+1) ea for the minimum spanning tree problem , 2014, GECCO.

[66]  Xin Yao,et al.  Fast Evolution Strategies , 1997, Evolutionary Programming.

[67]  Benjamin Doerr,et al.  Ranking-Based Black-Box Complexity , 2011, Algorithmica.

[68]  Carsten Witt,et al.  MMAS vs. population-based EA on a family of dynamic fitness functions , 2014, GECCO.

[69]  Frank Neumann,et al.  More effective crossover operators for the all-pairs shortest path problem , 2013, Theor. Comput. Sci..

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

[71]  Thomas Jansen,et al.  Approximating vertex cover using edge-based representations , 2013, FOGA XII '13.

[72]  Petr Posík,et al.  BBOB-benchmarking a simple estimation of distribution algorithm with cauchy distribution , 2009, GECCO '09.

[73]  Per Kristian Lehre,et al.  Faster black-box algorithms through higher arity operators , 2010, FOGA '11.

[74]  Dorian Nogneng,et al.  A new analysis method for evolutionary optimization of dynamic and noisy objective functions , 2018, GECCO.

[75]  Frank Neumann,et al.  Analyses of Simple Hybrid Algorithms for the Vertex Cover Problem , 2009, Evolutionary Computation.

[76]  Thomas Jansen,et al.  On the brittleness of evolutionary algorithms , 2007, FOGA'07.

[77]  Benjamin Doerr,et al.  Adjacency list matchings: an ideal genotype for cycle covers , 2007, GECCO '07.

[78]  Tobias Storch,et al.  How randomized search heuristics find maximum cliques in planar graphs , 2006, GECCO.

[79]  Zbigniew Michalewicz,et al.  Parameter Control in Evolutionary Algorithms , 2007, Parameter Setting in Evolutionary Algorithms.

[80]  Thomas Bäck,et al.  Optimal Mutation Rates in Genetic Search , 1993, ICGA.

[81]  Benjamin Doerr,et al.  The unbiased black-box complexity of partition is polynomial , 2014, Artif. Intell..

[82]  Tom Schaul,et al.  High dimensions and heavy tails for natural evolution strategies , 2011, GECCO '11.

[83]  Frank Neumann,et al.  Computing single source shortest paths using single-objective fitness , 2009, FOGA '09.

[84]  Benjamin Doerr,et al.  The ($$1+\lambda $$1+λ) Evolutionary Algorithm with Self-Adjusting Mutation Rate , 2018, Algorithmica.

[85]  Dirk Sudholt,et al.  Crossover is provably essential for the Ising model on trees , 2005, GECCO '05.

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

[87]  Ingo Wegener,et al.  Randomized local search, evolutionary algorithms, and the minimum spanning tree problem , 2004, Theor. Comput. Sci..

[88]  Benjamin Doerr,et al.  Memory-restricted black-box complexity of OneMax , 2012, Inf. Process. Lett..

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

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

[91]  Ingo Wegener,et al.  Real Royal Road Functions for Constant Population Size , 2003, GECCO.

[92]  Thomas Jansen,et al.  Mutation Rate Matters Even When Optimizing Monotonic Functions , 2013, Evolutionary Computation.

[93]  Benjamin Doerr,et al.  Improved analysis methods for crossover-based algorithms , 2009, GECCO.

[94]  Xin Yao,et al.  Evolutionary programming made faster , 1999, IEEE Trans. Evol. Comput..

[95]  Frank Neumann,et al.  Rigorous analyses of fitness-proportional selection for optimizing linear functions , 2008, GECCO '08.

[96]  Carsten Witt,et al.  UNIVERSITY OF DORTMUND REIHE COMPUTATIONAL INTELLIGENCE COLLABORATIVE RESEARCH CENTER 531 Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Worst-Case and Average-Case Approximations by Simple Randomized Search Heuristics , 2004 .

[97]  Benjamin Doerr,et al.  Multiplicative drift analysis , 2010, GECCO.