Fast Genetic Algorithms

03/09/2017
by   Benjamin Doerr, et al.
0

For genetic algorithms using a bit-string representation of length n, the general recommendation is to take 1/n as mutation rate. In this work, we discuss whether this is really justified for multimodal functions. Taking jump functions and the (1+1) evolutionary algorithm as the simplest example, we observe that larger mutation rates give significantly better runtimes. For the _m,n function, any mutation rate between 2/n and m/n leads to a speed-up at least exponential in m compared to the standard choice. The asymptotically best runtime, obtained from using the mutation rate m/n and leading to a speed-up super-exponential in m, is very sensitive to small changes of the mutation rate. Any deviation by a small (1 ±) factor leads to a slow-down exponential in m. Consequently, any fixed mutation rate gives strongly sub-optimal results for most jump functions. Building on this observation, we propose to use a random mutation rate α/n, where α is chosen from a power-law distribution. We prove that the (1+1) EA with this heavy-tailed mutation rate optimizes any _m,n function in a time that is only a small polynomial (in m) factor above the one stemming from the optimal rate for this m. Our heavy-tailed mutation operator yields similar speed-ups (over the best known performance guarantees) for the vertex cover problem in bipartite graphs and the matching problem in general graphs. Following the example of fast simulated annealing, fast evolution strategies, and fast evolutionary programming, we propose to call genetic algorithms using a heavy-tailed mutation operator fast genetic algorithms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/14/2020

Fast Mutation in Crossover-based Algorithms

The heavy-tailed mutation operator proposed in Doerr et al. (GECCO 2017)...
research
04/28/2022

A First Runtime Analysis of the NSGA-II on a Multimodal Problem

Very recently, the first mathematical runtime analyses of the multi-obje...
research
03/26/2014

How Crossover Speeds Up Building-Block Assembly in Genetic Algorithms

We re-investigate a fundamental question: how effective is crossover in ...
research
01/28/2022

Stagnation Detection meets Fast Mutation

Two mechanisms have recently been proposed that can significantly speed ...
research
02/09/2021

Optimal Static Mutation Strength Distributions for the (1+λ) Evolutionary Algorithm on OneMax

Most evolutionary algorithms have parameters, which allow a great flexib...
research
04/12/2023

An information-theoretic evolutionary algorithm

We propose a novel evolutionary algorithm on bit vectors which derives f...
research
05/11/2020

Feature Selection with Evolving, Fast and Slow Using Two Parallel Genetic Algorithms

Feature selection is one of the most challenging issues in machine learn...

Please sign up or login with your details

Forgot password? Click here to reset