The dynamics of mutation-selection algorithms with large population sizes
Year: 1996
Type: article
Abstract: We build the mutation-selection algorithm by randomly perturbing a very simple selection scheme. Our process belongs to the class of the generalized simulated annealing algorithms studied by Trouve. When the population size m is large, the various quantities associated with the algorithm are affine functions of m and the hierarchy of cycles on the set of uniform populations stabilizes. If the mutation kernel is symmetric, the limiting distribution is the uniform distribution over the set of the global maxima of the fitness function. The optimal convergence exponent defined by Azencott, Catoni and Trouve is an affine strictly increasing function of m.
Source: HAL
Author: Cerf, Raphaël
Institution: Université Paris-Sud
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W48895105
