Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift.

Abstract excerpt

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 movement away from the target into a high hitting time. We propose a simple negative drift theorem for multiplicative drift scenarios and show that it can simplify...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Algorithms
• Share to Biological Evolution
• Share to Computer Simulation