Why can genetic algorithms work in high-dimensional search spaces?

Stephen Whitelam

We show that the effective dynamics of the elitist $(1+M)$ genetic algorithm is, in the limit of small mutations, clipped gradient descent on the loss in the presence of anisotropi…