Lower Bounds for Non-Elitist Evolutionary Algorithms Via Negative Multiplicative Drift

05/02/2020
by   Benjamin Doerr, et al.
0

A decent number of lower bounds for non-elitist population-based evolutionary algorithms has been shown by now. Most of them are technically demanding due to the (hard to avoid) use of negative drift theorems – general results which translate an expected progress away from the target into a high hitting time. We propose a simple negative drift theorem for multiplicative drift scenarios and show that it simplifies many existing results. We discuss in more detail Lehre's (PPSN 2010) negative drift in populations method, one of the most general tools to prove lower bounds on the runtime of non-elitist evolutionary algorithms. Together with other arguments, we obtain an alternative and simpler proof, which also strengthens and simplifies this method. In particular, now only three of the five technical conditions of the previous result have to be verified. The lower bounds we obtain are explicit instead of only asymptotic. This allows to compute concrete lower bounds for concrete algorithms, but also enables us to show that super-polynomial runtimes appear already when the reproduction rate is only a (1 - ω(n^-1/2)) factor below the threshold. As one particular result, we apply this method, for the first time, to an algorithm using fitness-proportionate selection.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2017

Drift Analysis

Drift analysis is one of the major tools for analysing evolutionary algo...
research
11/30/2012

Erratum: Simplified Drift Analysis for Proving Lower Bounds in Evolutionary Computation

This erratum points out an error in the simplified drift theorem (SDT) [...
research
10/31/2019

Sharp Bounds for Genetic Drift in EDAs

Estimation of Distribution Algorithms (EDAs) are one branch of Evolution...
research
04/11/2019

Multiplicative Up-Drift

Drift analysis aims at translating the expected progress of an evolution...
research
05/04/2017

Evolutionary learning of fire fighting strategies

The dynamic problem of enclosing an expanding fire can be modelled by a ...
research
10/24/2018

Semantic Neutral Drift

We introduce the concept of Semantic Neutral Drift (SND) for evolutionar...
research
09/02/2023

Drift Analysis with Fitness Levels for Elitist Evolutionary Algorithms

The fitness level method is a popular tool for analyzing the computation...

Please sign up or login with your details

Forgot password? Click here to reset