“Estimation
of distribution algorithms with Kikuchi approximations”
by R. Santana.
*Evolutionary Computation*, vol. 13, no. 1, 2005, pp. 67-97.

The question of finding feasible ways for estimating probability distributions is one of the main challenges for Estimation of Distribution Algorithms (EDAs). To estimate the distribution of the selected solutions, EDAs use factorizations constructed according to graphical models. The class of factorizations that can be obtained from these probability models is highly constrained. Expanding the class of factorizations that could be employed for probability approximation is a necessary step for the conception of more robust EDAs. In this paper we introduce a method for learning a more general class of probability factorizations. The method combines a reformulation of a probability approximation procedure known in statistical physics as the Kikuchi approximation of energy, with a novel approach for finding graph decompositions. We present the Markov Network Estimation of Distribution Algorithm (MN-EDA), an EDA that uses Kikuchi approximations to estimate the distribution, and Gibbs Sampling (GS) to generate new points. A systematic empirical evaluation of MN-EDA is done in comparison with different Bayesian network based EDAs. From our experiments we conclude that the algorithm can outperform other EDAs that use traditional methods of probability approximation in the optimization of functions with strong interactions among their variables.

**BibTeX entry:**

@article{Santana:2005, author = {R. Santana}, title = {{E}stimation of distribution algorithms with {K}ikuchi approximations}, journal = {Evolutionary Computation}, volume = {13}, number = {1}, pages = {67--97}, year = {2005}, url = {http://www.mitpressjournals.org/doi/abs/10.1162/1063656053583496} }

(This webpage was created with bibtex2web.)

Back to Roberto Santana publications.