Population-based continuous optimization, probabilistic modelling and mean shift.
Evolutionary algorithms perform optimization using a population of sample solution points. An interesting development has been to view population-based optimization as the process of evolving an explicit, probabilistic model of the search space. This paper investigates a formal basis for continuous, population-based optimization in terms of a stochastic gradient descent on the Kullback-Leibler divergence between the model probability density and the objective function, represented as an unknown density of assumed form. This leads to an update rule that is related and compared with previous theoretical work, a continuous version of the population-based incremental learning algorithm, and the generalized mean shift clustering framework. Experimental results are presented that demonstrate the dynamics of the new algorithm on a set of simple test problems.
Gallagher
Marcus
M
School of Information Technology and Electrical Engineering, University of Queensland, Brisbane, QLD 4072, Australia. marcusg@itee.uq.edu.au
Frean
Marcus
M
D000465:Algorithms; D005075:Biological Evolution; D016000:Cluster Analysis; D019295:Computational Biology / Q000379:methods*; D019143:Evolution, Molecular; D015233:Models, Statistical; D008962:Models, Theoretical; D016011:Normal Distribution; D011157:Population Dynamics; D011336:Probability