Annealing schedule from population dynamics

We introduce a dynamical annealing schedule for population-based optimizati on algorithms with mutation. On the basis of a statistical mechanics formul ation of the population dynamics, the mutation rate adapts to a value maxim izing expected rewards at each time step. Thereby, the mutation rate is eli minated as a free parameter from the algorithm.