Proving μ>1

04/24/2020
by   Laurent Meunier, et al.
0

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

READ FULL TEXT

Please sign up or login with your details

Forgot password? Click here to reset

Sign in with Google

×

Use your Google Account to sign in to DeepAI

×

Consider DeepAI Pro