Message Passing Methods for Estimation of Distribution Algorithms Based on Markov Networks

Sampling methods are a fundamental component of estimation of distribution algorithms (EDAs). In this paper we propose new methods for generating solutions in EDAs based on Markov networks. These methods are based on the combination of message passing algorithms with decimation techniques for computing the maximum a posteriori solution of a probabilistic graphical model. The performance of the EDAs on a family of non-binary deceptive functions shows that the introduced approach improves results achieved with the sampling methods traditionally used by EDAs based on Markov networks.

[1]  Siddhartha Shakya,et al.  Optimization by estimation of distribution with DEUM framework based on Markov random fields , 2007, Int. J. Autom. Comput..

[2]  Hendrik Blockeel,et al.  Machine Learning: ECML 2003 , 2003, Lecture Notes in Computer Science.

[3]  Siddhartha Shakya,et al.  An EDA based on local markov property and gibbs sampling , 2008, GECCO '08.

[4]  Hans-Paul Schwefel,et al.  Parallel Problem Solving from Nature — PPSN IV , 1996, Lecture Notes in Computer Science.

[5]  Brendan J. Frey,et al.  Factor graphs and the sum-product algorithm , 2001, IEEE Trans. Inf. Theory.

[6]  Siddhartha Shakya,et al.  A Markovianity based optimisation algorithm , 2012, Genetic Programming and Evolvable Machines.

[7]  H. Mühlenbein.  Convergence Theorems of Estimation of Distribution Algorithms , 2012 .

[8]  Joris M. Mooij,et al.  libDAI: A Free and Open Source C++ Library for Discrete Approximate Inference in Graphical Models , 2010, J. Mach. Learn. Res..

[9]  Pedro Larrañaga,et al.  Estimation of Distribution Algorithms , 2002, Genetic Algorithms and Evolutionary Computation.

[10]  H. Mühlenbein,et al.  From Recombination of Genes to the Estimation of Distributions I. Binary Parameters , 1996, PPSN.

[11]  Roberto Santana.  A Markov Network Based Factorized Distribution Algorithm for Optimization , 2003, ECML.

[12]  Roberto Santana,et al.  Estimation of Distribution Algorithms with Kikuchi Approximations , 2005, Evolutionary Computation.

[13]  J. A. Lozano,et al.  Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms (Studies in Fuzziness and Soft Computing) , 2006 .

[14]  Pedro Larrañaga,et al.  Towards a New Evolutionary Computation - Advances in the Estimation of Distribution Algorithms , 2006, Towards a New Evolutionary Computation.

[15]  Pedro Larrañaga,et al.  Research topics in discrete estimation of distribution algorithms based on factorizations , 2009, Memetic Comput..

[16]  J. Pearl.  Causality: Models, Reasoning and Inference , 2000 .

[17]  J. A. Lozano,et al.  Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation , 2001 .

[18]  Bart Selman,et al.  Message-passing and local heuristics as decimation strategies for satisfiability , 2009, SAC '09.

[19]  Qingfu Zhang,et al.  An evolutionary algorithm with guided mutation for the maximum clique problem , 2005, IEEE Transactions on Evolutionary Computation.

[20]  Concha Bielza,et al.  A review on probabilistic graphical models in evolutionary computation , 2012, J. Heuristics.

[21]  Roberto Santana.  MN-EDA and the Use of Clique-Based Factorisations in EDAs , 2012 .

[22]  Jose A. Lozano,et al.  Fast Fitness Improvements in Estimation of Distribution Algorithms Using Belief Propagation , 2012 .

[23]  Siddhartha Shakya,et al.  Markov Networks in Evolutionary Computation , 2012 .