Title
Bayesian Evolutionary Optimization Using Helmholtz Machines
Abstract
Recently, several evolutionary algorithms have been proposed that build and use an explicit distribution model of the population to perform optimization. One of the main issues in this class of algorithms is how to estimate the distribution of selected samples. In this paper, we present a Bayesian evolutionary algorithm (BEA) that learns the sample distribution by a probabilistic graphical model known as Helmholtz machines. Due to the generative nature and availability of the wake-sleep learning algorithm, the Helmholtz machines provide an effective tool for modeling and sampling from the distribution of selected individuals. The proposed method has been applied to a suite of GA-deceptive functions. Experimental results show that the BEA with the Helmholtz machine outperforms the simple genetic algorithm.
Year
DOI
Venue
2000
10.1007/3-540-45356-3_81
PPSN
Keywords
Field
DocType
helmholtz machines,simple genetic algorithm,sample distribution,probabilistic graphical model,selected individual,explicit distribution model,evolutionary algorithm,helmholtz machine,selected sample,bayesian evolutionary optimization,bayesian evolutionary algorithm
Mathematical optimization,Estimation of distribution algorithm,Evolutionary algorithm,Computer science,Wake-sleep algorithm,Algorithm,Helmholtz machine,Helmholtz free energy,Bayesian network,Artificial intelligence,Graphical model,Genetic algorithm
Conference
ISBN
Citations 
PageRank 
3-540-41056-2
7
0.62
References 
Authors
10
2
Name
Order
Citations
PageRank
Byoung-Tak Zhang11571158.56
Soo-Yong Shin219617.20