
Selfadaptation in nonElitist Evolutionary Algorithms on Discrete Problems with Unknown Structure
A key challenge to make effective use of evolutionary algorithms is to c...
read it

Runtime Analysis of FitnessProportionate Selection on Linear Functions
This paper extends the runtime analysis of nonelitist evolutionary algo...
read it

On the Limitations of the Univariate Marginal Distribution Algorithm to Deception and Where Bivariate EDAs might help
We introduce a new benchmark problem called Deceptive Leading Blocks (DL...
read it

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...
read it

Parallel BlackBox Complexity with Tail Bounds
We propose a new blackbox complexity model for search algorithms evalua...
read it

LevelBased Analysis of the Univariate Marginal Distribution Algorithm
Estimation of Distribution Algorithms (EDAs) are stochastic heuristics t...
read it

LevelBased Analysis of the PopulationBased Incremental Learning Algorithm
The PopulationBased Incremental Learning (PBIL) algorithm uses a convex...
read it

Improved Runtime Bounds for the Univariate Marginal Distribution Algorithm via AntiConcentration
Unlike traditional evolutionary algorithms which produce offspring via g...
read it

Theoretical Analysis of Stochastic Search Algorithms
Theoretical analyses of stochastic search algorithms, albeit few, have a...
read it

Escaping Local Optima using Crossover with Emergent or Reinforced Diversity
Population diversity is essential for avoiding premature convergence in ...
read it

Populations can be essential in tracking dynamic optima
Realworld optimisation problems are often dynamic. Previously good solu...
read it

Selfadaptation of Mutation Rates in Nonelitist Populations
The runtime of evolutionary algorithms (EAs) depends critically on their...
read it

LevelBased Analysis of Genetic Algorithms for Combinatorial Optimization
The paper is devoted to upper bounds on runtime of NonElitist Genetic ...
read it

Levelbased Analysis of Genetic Algorithms and other Search Processes
Understanding how the timecomplexity of evolutionary algorithms (EAs) d...
read it

A Parameterized Complexity Analysis of Bilevel Optimisation with Evolutionary Algorithms
Bilevel optimisation problems have gained increasing interest in the fi...
read it

General Drift Analysis with Tail Bounds
Drift analysis is one of the stateoftheart techniques for the runtime...
read it

Finite First Hitting Time versus Stochastic Convergence in Particle Swarm Optimisation
We reconsider stochastic convergence analyses of particle swarm optimisa...
read it

On the Impact of MutationSelection Balance on the Runtime of Evolutionary Algorithms
The interplay between mutation and selection plays a fundamental role in...
read it

Faster BlackBox Algorithms Through Higher Arity Operators
We extend the work of Lehre and Witt (GECCO 2010) on the unbiased black...
read it
Per Kristian Lehre
is this you? claim profile
Senior Lecturer (Associate Professor) in School of Computer Science at the University of Birmingham.