Annealing schedule from population dynamics
统计力学
2009-10-31 v1 adap-org
适应与自组织系统
种群与进化
摘要
We introduce a dynamical annealing schedule for population-based optimization algorithms with mutation. On the basis of a statistical mechanics formulation of the population dynamics, the mutation rate adapts to a value maximizing expected rewards at each time step. Thereby, the mutation rate is eliminated as a free parameter from the algorithm.
引用
@article{arxiv.cond-mat/9903077,
title = {Annealing schedule from population dynamics},
author = {Stefan Bornholdt},
journal= {arXiv preprint arXiv:cond-mat/9903077},
year = {2009}
}
备注
6 pages RevTeX, 4 figures PostScript; to be published in Phys. Rev. E