Runtime Analysis of Evolutionary Algorithms via Symmetry Arguments

06/08/2020
by   Benjamin Doerr, et al.
0

We use an elementary argument building on group actions to prove that the selection-free steady state genetic algorithm analyzed by Sutton and Witt (GECCO 2019) takes an expected number of Ω(2^n / √(n)) iterations to find any particular target search point, regardless of the population size μ. This improves over the previous best lower bound of Ω((n^δ/2)) valid for population sizes μ = O(n^1/2 - δ), 0 < δ < 1/2.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/04/2017

Standard Steady State Genetic Algorithms Can Hillclimb Faster than Mutation-only Evolutionary Algorithms

Explaining to what extent the real power of genetic algorithms lies in t...
research
02/14/2022

Stochastic models of Jaya and semi-steady-state Jaya algorithms

We build stochastic models for analyzing Jaya and semi-steady-state Jaya...
research
03/26/2019

A Tight Runtime Analysis for the cGA on Jump Functions---EDAs Can Cross Fitness Valleys at No Extra Cost

We prove that the compact genetic algorithm (cGA) with hypothetical popu...
research
02/15/2006

Revisiting Evolutionary Algorithms with On-the-Fly Population Size Adjustment

In an evolutionary algorithm, the population has a very important role a...
research
04/19/2023

Comma Selection Outperforms Plus Selection on OneMax with Randomly Planted Optima

It is an ongoing debate whether and how comma selection in evolutionary ...
research
04/13/2011

Idealized Dynamic Population Sizing for Uniformly Scaled Problems

This paper explores an idealized dynamic population sizing strategy for ...
research
05/30/2011

Predicting the Structure of Alloys using Genetic Algorithms

We discuss a novel genetic algorithm that can be used to find global min...

Please sign up or login with your details

Forgot password? Click here to reset