Solving the Ising Spin Glass Problem using a Bivariate EDA based on Markov Random Fields

Markov random field (MRF) modelling techniques have been recently proposed as a novel approach to probabilistic modelling for estimation of distribution algorithms (EDAs). An EDA using this technique was called distribution estimation using Markov random fields (DEUM). DEUM was later extended to DEUMd. DEUM and DEUMd use a univariate model of probability distribution, and have been shown to perform better than other univariate EDAs for a range of optimization problems. This paper extends DEUM to use a bivariate model and applies it to the Ising spin glass problems. We propose two variants of DEUM that use different sampling techniques. Our experimental result show a noticeable gain in performance.

[1]  Donald Geman,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1984 .

[2]  N. Metropolis,et al.  Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[3]  Steffen L. Lauritzen,et al.  Graphical models in R , 1996 .

[4]  J. M. Hammersley,et al.  Markov fields on finite graphs and lattices , 1971 .

[5]  John McCall,et al.  Estimating the distribution in an EDA , 2005 .

[6]  J. McCall,et al.  Incorporating a Metropolis method in a distribution estimation using Markov random field algorithm , 2005, 2005 IEEE Congress on Evolutionary Computation.

[7]  Heinz Mühlenbein,et al.  FDA -A Scalable Evolutionary Algorithm for the Optimization of Additively Decomposed Functions , 1999, Evolutionary Computation.

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

[9]  Michael I. Jordan,et al.  An Introduction to Variational Methods for Graphical Models , 1999, Machine-mediated learning.

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

[11]  David E. Goldberg,et al.  Hierarchical BOA Solves Ising Spin Glasses and MAXSAT , 2003, GECCO.

[12]  John A. W. McCall,et al.  Markov Random Field Modelling of Royal Road Genetic Algorithms , 2001, Artificial Evolution.

[13]  Martin Pelikan,et al.  Computational Complexity and Simulation of Rare Events of Ising Spin Glasses , 2004, GECCO.

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

[15]  Stan Z. Li,et al.  Markov Random Field Modeling in Computer Vision , 1995, Computer Science Workbench.

[16]  Donald Geman,et al.  Gibbs distributions and the bayesian restoration of images , 1984 .

[17]  J. Laurie Snell,et al.  Markov Random Fields and Their Applications , 1980 .

[18]  John McCall,et al.  Updating the probability vector using MRF technique for a Univariate EDA , 2004 .

[19]  David J. Spiegelhalter,et al.  Local computations with probabilities on graphical structures and their application to expert systems , 1990 .

[20]  Zoubin Ghahramani,et al.  Bayesian Learning in Undirected Graphical Models: Approximate MCMC Algorithms , 2004, UAI.

[21]  Siddhartha Shakya,et al.  Using a Markov network model in a univariate EDA: an empirical cost-benefit analysis , 2005, GECCO '05.

[22]  M. Pelikán,et al.  The Bivariate Marginal Distribution Algorithm , 1999 .

[23]  Heinz Mühlenbein,et al.  Schemata, Distributions and Graphical Models in Evolutionary Optimization , 1999, J. Heuristics.

[24]  David E. Goldberg,et al.  Bayesian Optimization Algorithm: From Single Level to Hierarchy , 2002 .

[25]  Judea Pearl,et al.  Probabilistic reasoning in intelligent systems , 1988 .

[26]  Stuart German,et al.  Stochastic relaxation, Gibbs distributions, and the Bayesian restoration of images , 1988 .