Improved Runtime Bound for the $(\mu +1)$ EA on BinVal

Joris Belder, Johannes Lengler, Raghu Raman Ravi

We study the $(\mu +1)$ EA on the Binary Value function BinVal. We show that it needs at most $O(\mu \log \mu \cdot n\log n)$ function evaluations to find the optimum when $\mu =o(n/\log n)$…