A. Kelley

activity

20182026

most citedThe Runtime of Random Local Search on the Generalized Needle Problem

3 citations · 7 across the 6 of their papers we have counts for

collaborators

Showing cs.NEShow all

4 papers · 1 filter

cs.NE2026

All Mutation Rates $c / n$ for the $(1 + 1)$ Evolutionary Algorithm

Andrew James Kelley

For every real number $c \geq 1$ and for all $ε > 0$ , there is a fitness function $f : {0, 1}^{n} \to R$ for which the optimal mutation rate for the $(1 + 1)$ evolu…

cs.NE2026

All Constant Mutation Rates for the $(1 + 1)$ Evolutionary Algorithm

Andrew James Kelley

For every mutation rate $p \in (0, 1)$ , and for all $ε > 0$ , there is a fitness function $f : {0, 1}^{n} \to R$ with a unique maximum for which the optimal mutati…

cs.NE2024★ 3 cited

The Runtime of Random Local Search on the Generalized Needle Problem

Benjamin Doerr, Andrew James Kelley

In their recent work, C. Doerr and Krejca (Transactions on Evolutionary Computation, 2023) proved upper bounds on the expected runtime of the randomized local search heuristic on g…

cs.NE2023★ 2 cited

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus

Benjamin Doerr, Andrew James Kelley

We propose a new method based on discrete Fourier analysis to analyze the time evolutionary algorithms spend on plateaus. This immediately gives a concise proof of the classic esti…

All Mutation Rates c/n for the (1+1) Evolutionary Algorithm

All Constant Mutation Rates for the (1+1) Evolutionary Algorithm

The Runtime of Random Local Search on the Generalized Needle Problem

Fourier Analysis Meets Runtime Analysis: Precise Runtimes on Plateaus

All Mutation Rates $c / n$ for the $(1 + 1)$ Evolutionary Algorithm

All Constant Mutation Rates for the $(1 + 1)$ Evolutionary Algorithm