111

Proving μ>1μ>1

Abstract

Choosing the right selection rate is a long standing issue in evolutionary computation. In the continuous unconstrained case, we prove mathematically that μ=1\mu=1 leads to a sub-optimal simple regret in the case of the sphere function. We provide a theoretically-based selection rate μ/λ\mu/\lambda that leads to better convergence rates. With our choice of selection rate, we get a provable regret of order O(λ1)O(\lambda^{-1}) which has to be compared with O(λ2/d)O(\lambda^{-2/d}) in the case where μ=1\mu=1. We complete our study with experiments to confirm our theoretical claims.

View on arXiv
Comments on this paper