Progress Rate in Noisy Genetic Programming for Choosing λ
Abstract
Recently, it has been proposed to use Bernstein races for implementing non-regression testing in noisy genetic programming. We study the population size of such a (1+λ) evolutionary algorithm applied to a noisy fitness function optimization by a progress rate analysis and experiment it on a policy search application.
Origin | Files produced by the author(s) |
---|
Loading...