Does Comma Selection Help To Cope With Local Optima

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

One hope of using non-elitism in evolutionary computation is that it aids leaving local optima. We perform a rigorous runtime analysis of a basic non-elitist evolutionary algorithm (EA), the (μ,λ) EA, on the most basic benchmark function with a local optimum, the jump function. We prove that for all reasonable values of the parameters and the problem, the expected runtime of the (μ,λ) EA is, apart from lower order terms, at least as large as the expected runtime of its elitist counterpart, the (μ+λ) EA (for which we conduct the first runtime analysis to allow this comparison). Consequently, the ability of the (μ,λ) EA to leave local optima to inferior solutions does not lead to a runtime advantage. We complement this lower bound with an upper bound that, for broad ranges of the parameters, is identical to our lower bound apart from lower order terms. This is the first runtime result for a non-elitist algorithm on a multi-modal problem that is tight apart from lower order terms.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/21/2023

How Well Does the Metropolis Algorithm Cope With Local Optima?

The Metropolis algorithm (MA) is a classic stochastic local search heuri...
research
04/19/2019

Runtime Analysis of the Univariate Marginal Distribution Algorithm under Low Selective Pressure and Prior Noise

We perform a rigorous runtime analysis for the Univariate Marginal Distr...
research
03/31/2017

Upper Bounds on the Runtime of the Univariate Marginal Distribution Algorithm on OneMax

A runtime analysis of the Univariate Marginal Distribution Algorithm (UM...
research
12/28/2018

A Tight Runtime Analysis for the (μ+ λ) EA

Despite significant progress in the theory of evolutionary algorithms, t...
research
04/14/2021

When Non-Elitism Meets Time-Linkage Problems

Many real-world applications have the time-linkage property, and the onl...
research
04/20/2023

How the Move Acceptance Hyper-Heuristic Copes With Local Optima: Drastic Differences Between Jumps and Cliffs

In recent work, Lissovoi, Oliveto, and Warwicker (Artificial Intelligenc...
research
09/28/2022

From Understanding the Population Dynamics of the NSGA-II to the First Proven Lower Bounds

Due to the more complicated population dynamics of the NSGA-II, none of ...

Please sign up or login with your details

Forgot password? Click here to reset