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 ...
share
research
∙
04/19/2023
Analysing Equilibrium States for Population Diversity
Population diversity is crucial in evolutionary algorithms as it helps w...
research
∙
02/23/2023
Tight Runtime Bounds for Static Unary Unbiased Evolutionary Algorithms on Linear Functions
In a seminal paper in 2013, Witt showed that the (1+1) Evolutionary Algo...
research
∙
04/14/2022
OneMax is not the Easiest Function for Fitness Improvements
We study the (1:s+1) success rule for controlling the population size of...
research
∙
04/13/2022
Population Diversity Leads to Short Running Times of Lexicase Selection
In this paper we investigate why the running time of lexicase parent sel...
research
∙
04/01/2022
Self-adjusting Population Sizes for the (1, λ)-EA on Monotone Functions
We study the (1,λ)-EA with mutation rate c/n for c≤ 1, where the populat...
research
∙
03/28/2022
Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be Hard
In this paper we show how to use drift analysis in the case of two rando...
research
∙
10/26/2020
Runtime analysis of the (mu+1)-EA on the Dynamic BinVal function
We study evolutionary algorithms in a dynamic setting, where for each ge...
research
∙
04/21/2020
Large Population Sizes and Crossover Help in Dynamic Environments
Dynamic linear functions on the hypercube are functions which assign to ...
research
∙
02/12/2020
An Optimal Decentralized (Δ+ 1)-Coloring Algorithm
Consider the following simple coloring algorithm for a graph on n vertic...
research
∙
07/30/2019
Exponential Slowdown for Larger Populations: The (μ+1)-EA on Monotone Functions
Pseudo-Boolean monotone functions are unimodal functions which are trivi...
research
∙
02/07/2019
Self-Adjusting Mutation Rates with Provably Optimal Success Rules
The one-fifth success rule is one of the best-known and most widely acce...
research
∙
08/16/2018
The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates
We study unbiased (1+1) evolutionary algorithms on linear functions with...
research
∙
08/03/2018
When Does Hillclimbing Fail on Monotone Functions: An entropy compression argument
Hillclimbing is an essential part of any optimization algorithm. An impo...
research
∙
06/06/2018
Bounding Bloat in Genetic Programming
While many optimization problems work with a fixed number of decision va...
research
∙
05/25/2018
Destructiveness of Lexicographic Parsimony Pressure and Alleviation by a Concatenation Crossover in Genetic Programming
For theoretical analyses there are two specifics distinguishing GP from ...
research
∙
03/25/2018
A General Dichotomy of Evolutionary Algorithms on Monotone Functions
It is known that the evolutionary algorithm (1+1)-EA with mutation rate ...
research
∙
03/12/2018
Sorting by Swaps with Noisy Comparisons
We study sorting of permutations by random swaps if each comparison give...
research
∙
12/04/2017
Drift Analysis
Drift analysis is one of the major tools for analysing evolutionary algo...
research
∙
08/10/2016
Drift Analysis and Evolutionary Algorithms Revisited
One of the easiest randomized greedy optimization algorithms is the foll...
research
∙
04/08/2016
The (1+1) Elitist Black-Box Complexity of LeadingOnes
One important goal of black-box complexity theory is the development of ...
research
∙
08/27/2015
Introducing Elitist Black-Box Models: When Does Elitist Selection Weaken the Performance of Evolutionary Algorithms?
Black-box complexity theory provides lower bounds for the runtime of bla...
research
∙
04/10/2015
OneMax in Black-Box Models with Several Restrictions
Black-box complexity studies lower bounds for the efficiency of general-...
research
∙
08/01/2011