The linear hidden subset problem for the (1+1) EA with scheduled and adaptive mutation rates

Hafsteinn Einarsson, Marcelo Matheus Gauy, Johannes Lengler +4

We study unbiased $(1+1)$ evolutionary algorithms on linear functions with an unknown number $n$ of bits with non-zero weight. Static algorithms achieve an optimal runtime of $O(n…