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

11/30/2012
by   Pietro S. Oliveto, et al.
0

This erratum points out an error in the simplified drift theorem (SDT) [Algorithmica 59(3), 369-386, 2011]. It is also shown that a minor modification of one of its conditions is sufficient to establish a valid result. In many respects, the new theorem is more general than before. We no longer assume a Markov process nor a finite search space. Furthermore, the proof of the theorem is more compact than the previous ones. Finally, previous applications of the SDT are revisited. It turns out that all of these either meet the modified condition directly or by means of few additional arguments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/02/2020

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

A decent number of lower bounds for non-elitist population-based evoluti...
research
07/09/2013

General Drift Analysis with Tail Bounds

Drift analysis is one of the state-of-the-art techniques for the runtime...
research
06/30/2019

Upper bounds on the graph minor theorem

Lower bounds on the proof-theoretic strength of the graph minor theorem ...
research
04/11/2019

Multiplicative Up-Drift

Drift analysis aims at translating the expected progress of an evolution...
research
05/22/2018

First-Hitting Times Under Additive Drift

For the last ten years, almost every theoretical result concerning the e...
research
03/05/2020

From Kruskal's theorem to Friedman's gap condition

Harvey Friedman's gap condition on embeddings of finite labelled trees p...
research
05/03/2000

Robustness of Regional Matching Scheme over Global Matching Scheme

The paper has established and verified the theory prevailing widely amon...

Please sign up or login with your details

Forgot password? Click here to reset