v1v2v3v4 (latest)

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

Evolutionary Computation (Evol. Comput.), 2020

2 May 2020

Benjamin Doerr

ArXiv (abs)PDF HTML

Papers citing "Lower Bounds for Non-Elitist Evolutionary Algorithms via Negative Multiplicative Drift"

9 / 9 papers shown

Analysing the Robustness of NSGA-II under NoiseAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2023

287

07 Jun 2023

Stochastic Population Update Can Provably Be Helpful in Multi-Objective Evolutionary AlgorithmsInternational Joint Conference on Artificial Intelligence (IJCAI), 2023

281

05 Jun 2023

Analysing Equilibrium States for Population DiversityAnnual Conference on Genetic and Evolutionary Computation (GECCO), 2023

Johannes Lengler

Andre Opris

Dirk Sudholt

130

19 Apr 2023

Two-Dimensional Drift Analysis: Optimizing Two Functions Simultaneously Can Be HardParallel Problem Solving from Nature (PPSN), 2022

D. Janett

Johannes Lengler

330

28 Mar 2022

Choosing the Right Algorithm With Hints From Complexity Theory

Shouda Wang

Weijie Zheng

Benjamin Doerr

498

14 Sep 2021

A Survey on Recent Progress in the Theory of Evolutionary Algorithms for Discrete Optimization

Benjamin Doerr

Frank Neumann

389

30 Jun 2020

Exponential Upper Bounds for the Runtime of Randomized Search HeuristicsParallel Problem Solving from Nature (PPSN), 2020

Benjamin Doerr

418

13 Apr 2020

Does Comma Selection Help To Cope With Local Optima

Benjamin Doerr

322

02 Apr 2020

An Exponential Lower Bound for the Runtime of the cGA on Jump Functions

Benjamin Doerr

223

17 Apr 2019