Theory for non-theoreticians: introductory tutorial

[1]  Benjamin Doerr,et al.  Self-Adjusting Mutation Rates with Provably Optimal Success Rules , 2019, Algorithmica.

[2]  Benjamin Doerr,et al.  Significance-Based Estimation-of-Distribution Algorithms , 2018, IEEE Transactions on Evolutionary Computation.

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

[4]  Andrew M. Sutton,et al.  When resampling to cope with noise, use median, not mean , 2019, GECCO.

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

[6]  Weijie Zheng,et al.  Working principles of binary differential evolution , 2018, GECCO.

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

[8]  Dirk Sudholt,et al.  On the robustness of evolutionary algorithms to noise: refined results and an example where noise helps , 2018, GECCO.

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

[10]  Dirk Sudholt,et al.  Medium step sizes are harmful for the compact genetic algorithm , 2018, GECCO.

[11]  Angelika Steger,et al.  The linear hidden subset problem for the (1 + 1) EA with scheduled and adaptive mutation rates , 2018, GECCO.

[12]  Chao Qian,et al.  Running Time Analysis of the (1+1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$1+1$$\end{document})-EA for OneMax an , 2017, Algorithmica.

[13]  Angelika Steger,et al.  Drift Analysis and Evolutionary Algorithms Revisited , 2016, Combinatorics, Probability and Computing.

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

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

[16]  Andrew M. Sutton,et al.  The Compact Genetic Algorithm is Efficient Under Extreme Gaussian Noise , 2017, IEEE Transactions on Evolutionary Computation.

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

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

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

[20]  Carsten Witt,et al.  Lower Bounds on the Run Time of the Univariate Marginal Distribution Algorithm on OneMax , 2017, FOGA '17.

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

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

[23]  Tobias Friedrich,et al.  EDAs cannot be Balanced and Stable , 2016, GECCO.

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

[25]  Olivier Teytaud,et al.  Analysis of runtime of optimization algorithms for noisy functions over discrete codomains , 2015, Theor. Comput. Sci..

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

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

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

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

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

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

[32]  Carsten Witt,et al.  (1+1) EA on Generalized Dynamic OneMax , 2015, FOGA.

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

[34]  Timo Kötzing,et al.  Robustness of Populations in Stochastic Environments , 2014, Algorithmica.

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

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

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

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

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

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

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

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

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

[44]  Benjamin Doerr,et al.  Playing Mastermind With Many Colors , 2012, SODA.

[45]  Benjamin Doerr,et al.  Reducing the arity in unbiased black-box complexity , 2012, GECCO '12.

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

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

[48]  Dirk Sudholt,et al.  A Simple Ant Colony Optimizer for Stochastic Shortest Path Problems , 2012, Algorithmica.

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

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

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

[52]  Frank Neumann,et al.  More Effective Crossover Operators for the All-Pairs Shortest Path Problem , 2010, PPSN.

[53]  Per Kristian Lehre,et al.  Black-Box Search by Unbiased Variation , 2010, GECCO '10.

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

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

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

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

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

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

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

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

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

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

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

[65]  Frank Neumann,et al.  Speeding Up Evolutionary Algorithms through Asymmetric Mutation Operators , 2007, Evolutionary Computation.

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

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

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

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

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

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

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

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

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

[75]  Stefan Droste,et al.  Design and Management of Complex Technical Processes and Systems by means of Computational Intelligence Methods Analysis of the (1+1) EA for a Noisy OneMax , 2004 .

[76]  Ingo Wegener,et al.  Real royal road functions for constant population size , 2003, Theor. Comput. Sci..

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

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

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

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

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

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

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

[84]  David E. Goldberg,et al.  The compact genetic algorithm , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

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