Evolutionary Algorithms with Self-adjusting Asymmetric Mutation

Evolutionary Algorithms (EAs) and other randomized search heuristics are often considered as unbiased algorithms that are invariant with respect to different transformations of the underlying search space. However, if a certain amount of domain knowledge is available the use of biased search operators in EAs becomes viable. We consider a simple (1+1) EA for binary search spaces and analyze an asymmetric mutation operator that can treat zero- and one-bits differently. This operator extends previous work by Jansen and Sudholt (ECJ 18(1), 2010) by allowing the operator asymmetry to vary according to the success rate of the algorithm. Using a self-adjusting scheme that learns an appropriate degree of asymmetry, we show improved runtime results on the class of functions OneMax$_a$ describing the number of matching bits with a fixed target $a\in\{0,1\}^n$.

[1]  L. Dworsky.  An Introduction to Probability , 2008 .

[2]  Hao Wang,et al.  Towards a theory-guided benchmarking suite for discrete black-box optimization heuristics: profiling (1 + λ) EA variants on onemax and leadingones , 2018, GECCO.

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

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

[5]  Andrew M. Sutton.  Superpolynomial lower bounds for the (1+1) EA on some easy combinatorial problems , 2014, GECCO.

[6]  Thomas Jansen,et al.  Analysis of an Asymmetric Mutation Operator , 2010, Evolutionary Computation.

[7]  P. A. P. Moran,et al.  An introduction to probability theory , 1968 .

[8]  Mario Alejandro,et al.  An empirical evaluation of success-based parameter control mechanisms for evolutionary algorithms , 2019, GECCO.

[9]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1951 .

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

[11]  Markus Wagner,et al.  Sensitivity of Parameter Control Mechanisms with Respect to Their Initialization , 2018, PPSN.

[12]  Arina Buzdalova,et al.  Offspring population size matters when comparing evolutionary algorithms with self-adjusting mutation rates , 2019, GECCO.

[13]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

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

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

[16]  Frank Neumann,et al.  Evolutionary Image Transition Using Random Walks , 2017, EvoMUSART.

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

[18]  Bryant A. Julstrom,et al.  Biased mutation operators for subgraph-selection problems , 2006, IEEE Transactions on Evolutionary Computation.

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

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

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

[22]  Andrew M. Sutton.  Superpolynomial Lower Bounds for the $$(1+1)$$(1+1) EA on Some Easy Combinatorial Problems , 2015, Algorithmica.

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

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

[25]  Benjamin Doerr,et al.  Theory of Parameter Control for Discrete Black-Box Optimization: Provable Performance Gains Through Dynamic Parameter Choices , 2018, Theory of Evolutionary Computation.

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

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

[28]  Frank Neumann,et al.  Randomized Local Search, Evolutionary Algorithms, and the Minimum Spanning Tree Problem , 2004, GECCO.

[29]  Carola Doerr,et al.  Complexity Theory for Discrete Black-Box Optimization Heuristics , 2018, Theory of Evolutionary Computation.

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

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