Lower bounds from fitness levels made easy

One of the first and easy to use techniques for proving run time bounds for evolutionary algorithms is the so-called method of fitness levels by Wegener. It uses a partition of the search space into a sequence of levels which are traversed by the algorithm in increasing order, possibly skipping levels. An easy, but often strong upper bound for the run time can then be derived by adding the reciprocals of the probabilities to leave the levels (or upper bounds for these). Unfortunately, a similarly effective method for proving lower bounds has not yet been established. The strongest such method, proposed by Sudholt (2013), requires a careful choice of the viscosity parameters γi,j, 0 ≤ i ≤ j ≤ n. In this paper we present two new variants of the method, one for upper and one for lower bounds. Besides the level leaving probabilities, they only rely on the probabilities that levels are visited at all. We show that these can be computed or estimated without greater difficulties and apply our method to reprove the following known results in an easy and natural way. (i) The precise run time of the (1 + 1) EA on LeadingOnes. (ii) A lower bound for the run time of the (1 + 1) EA on OneMax, tight apart from an O(n) term. (iii) A lower bound for the run time of the (1 + 1) EA on long k-paths.

[1]  Carsten Witt,et al.  Self-Adjusting Evolutionary Algorithms for Multimodal Optimization , 2020, Algorithmica.

[2]  Benjamin Doerr,et al.  A rigorous runtime analysis of the 2-MMASib on jump functions: ant colony optimizers can cope well with local optima , 2021, GECCO.

[3]  Lazy parameter tuning and control: choosing all parameters randomly from a power-law distribution , 2021, GECCO.

[4]  C. Witt,et al.  Stagnation detection in highly multimodal fitness landscapes , 2021, GECCO.

[5]  C. Witt,et al.  Stagnation Detection with Randomized Local Search* , 2021, Evolutionary Computation.

[6]  Benjamin Doerr,et al.  Theoretical Analyses of Multiobjective Evolutionary Algorithms on Multimodal Objectives. , 2020, Evolutionary computation.

[7]  Benjamin Doerr,et al.  First Steps Towards a Runtime Analysis When Starting With a Good Solution , 2020, PPSN.

[8]  Benjamin Doerr,et al.  Runtime Analysis of a Heavy-Tailed (1+(λ, λ)) Genetic Algorithm on Jump Functions , 2020, PPSN.

[9]  Benjamin Doerr,et al.  The impact of lexicographic parsimony pressure for ORDER/MAJORITY on the run time , 2020, Theor. Comput. Sci..

[10]  Benjamin Doerr,et al.  Fixed-Target Runtime Analysis , 2020, GECCO.

[11]  Benjamin Doerr,et al.  The (1 + (λ,λ)) GA is even faster on multimodal problems , 2020, GECCO.

[12]  Benjamin Doerr.  Does Comma Selection Help to Cope with Local Optima? , 2020, GECCO.

[13]  Benjamin Doerr,et al.  Multiplicative Up-Drift , 2019, Algorithmica.

[14]  Benjamin Doerr,et al.  Probabilistic Tools for the Analysis of Randomized Optimization Heuristics , 2018, Theory of Evolutionary Computation.

[15]  Thomas Bäck,et al.  Theory of Evolutionary Computation: Recent Developments in Discrete Optimization , 2020, Theory of Evolutionary Computation.

[16]  Aishwaryaprajna,et al.  The benefits and limitations of voting mechanisms in evolutionary optimisation , 2019, FOGA '19.

[17]  Andrei Lissovoi,et al.  On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation , 2019, AAAI.

[18]  Hsien-Kuei Hwang,et al.  Sharp bounds on the runtime of the (1+1) EA via drift analysis and analytic combinatorial tools , 2019, FOGA '19.

[19]  Benjamin Doerr,et al.  Analyzing randomized search heuristics via stochastic domination , 2019, Theor. Comput. Sci..

[20]  Pietro Simone Oliveto,et al.  Fast Artificial Immune Systems , 2018, PPSN.

[21]  Per Kristian Lehre,et al.  Escaping Local Optima Using Crossover With Emergent Diversity , 2018, IEEE Transactions on Evolutionary Computation.

[22]  Hsien-Kuei Hwang,et al.  Probabilistic Analysis of the (1+1)-Evolutionary Algorithm , 2014, Evolutionary Computation.

[23]  Benjamin Doerr,et al.  Static and Self-Adjusting Mutation Strengths for Multi-valued Decision Variables , 2018, Algorithmica.

[24]  Pietro Simone Oliveto,et al.  On the runtime analysis of the opt-IA artificial immune system , 2017, GECCO.

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

[26]  Carsten Witt,et al.  The Interplay of Population Size and Mutation Probability in the (1+λ) EA on OneMax , 2017, Algorithmica.

[27]  Carsten Witt,et al.  The Interplay of Population Size and Mutation Probability in the ($$1+\lambda $$1+λ) EA on OneMax , 2016, Algorithmica.

[28]  Carsten Witt,et al.  Optimal Mutation Rates 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}$$\lambda $$\end{document}) EA on One , 2017, Algorithmica.

[29]  Duc-Cuong Dang,et al.  Escaping Local Optima with Diversity Mechanisms and Crossover , 2016, GECCO.

[30]  Benjamin Doerr,et al.  Optimal Parameter Choices via Precise Black-Box Analysis , 2016, GECCO.

[31]  Duc-Cuong Dang,et al.  Level-Based Analysis of Genetic Algorithms and Other Search Processes , 2014, bioRxiv.

[32]  Duc-Cuong Dang,et al.  Runtime Analysis of Non-elitist Populations: From Classical Optimisation to Partial Information , 2016, Algorithmica.

[33]  Benjamin Doerr,et al.  The Impact of Random Initialization on the Runtime of Randomized Search Heuristics , 2015, Algorithmica.

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

[35]  Dirk Sudholt,et al.  General Upper Bounds on the Runtime of Parallel Evolutionary Algorithms* , 2014, Evolutionary Computation.

[36]  Thomas Jansen,et al.  Performance analysis of randomised search heuristics operating with a fixed budget , 2014, Theor. Comput. Sci..

[37]  Carsten Witt,et al.  Fitness levels with tail bounds for the analysis of randomized search heuristics , 2014, Inf. Process. Lett..

[38]  Thomas Jansen,et al.  A method to derive fixed budget results from expected optimisation times , 2013, GECCO '13.

[39]  Timo Kötzing,et al.  Optimizing expected path lengths with ant colony optimization using fitness proportional update , 2013, FOGA XII '13.

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

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

[42]  Per Kristian Lehre,et al.  Drift analysis , 2012, GECCO '12.

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

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

[45]  Per Kristian Lehre,et al.  Fitness-levels for non-elitist populations , 2011, GECCO '11.

[46]  Benjamin Doerr,et al.  Optimal Fixed and Adaptive Mutation Rates for the LeadingOnes Problem , 2010, PPSN.

[47]  Dirk Sudholt,et al.  General Lower Bounds for the Running Time of Evolutionary Algorithms , 2010, PPSN.

[48]  Per Kristian Lehre,et al.  Negative Drift in Populations , 2010, PPSN.

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

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

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

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

[53]  Dirk Sudholt,et al.  The impact of parametrization in memetic evolutionary algorithms , 2009, Theor. Comput. Sci..

[54]  Jens Jägersküpper,et al.  Algorithmic analysis of a basic evolutionary algorithm for continuous optimization , 2007, Theor. Comput. Sci..

[55]  Ingo Wegener,et al.  Methods for the Analysis of Evolutionary Algorithms on Pseudo-Boolean Functions , 2003 .

[56]  Thomas Jansen,et al.  The Analysis of Evolutionary Algorithms—A Proof That Crossover Really Can Help , 2002, Algorithmica.

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

[58]  Ingo Wegener,et al.  Theoretical Aspects of Evolutionary Algorithms , 2001, ICALP.

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

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

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

[62]  Günter Rudolph,et al.  How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time , 1996, Evolutionary Computation.

[63]  B. Harshbarger.  An Introduction to Probability Theory and its Applications, Volume I , 1958 .