Blocked stochastic sampling versus Estimation of Distribution Algorithms

Roberto Santana, Heinz MühlenbeinIEEE CEC 2002 · OpenReview

Abstract

The Boltzmann distribution is a good candidate for a search distribution for optimization problems. We compare two methods to approximate the Boltzmann distribution - Estimation of Distribution Algorithms (EDA) and Markov Chain Monte Carlo methods (MCMC). It turns out that in the space of binary functions even blocked MCMC methods outperform EDA on a small class of problems only. In these cases a temperature of T = 0 performed best.
BibTeX
@inproceedings{santana2002blocked,
  author = {Roberto Santana and Heinz Mühlenbein},
  title = {{Blocked stochastic sampling versus Estimation of Distribution Algorithms}},
  booktitle = {IEEE CEC},
  year = {2002},
  url = {https://openreview.net/forum?id=iiE41Tpl53f},
}

Loading related content...

Figure