Drift and Scaling in Estimation of Distribution Algorithms

@article{Shapiro2005DriftAS,
  title={Drift and Scaling in Estimation of Distribution Algorithms},
  author={Jonathan L. Shapiro},
  journal={Evolutionary Computation},
  year={2005},
  volume={13},
  pages={99-123}
}
This paper considers a phenomenon in Estimation of Distribution Algorithms (EDA) analogous to drift in population genetic dynamics. Finite population sampling in selection results in fluctuations which get reinforced when the probability model is updated. As a consequence, any probability model which can generate only a single set of values with probability 1 can be an attractive fixed point of the algorithm. To avoid this, parameters of the algorithm must scale with the system size in strongly… CONTINUE READING
30 Citations
23 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 30 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 23 references

A study of the effect of detailed balance on PBIL in k-sat and the p-median problem

  • E. S. Correa, J. L. Shapiro
  • Applications and Science in Soft Computing…
  • 2004
Highly Influential
5 Excerpts

The sensitivity of pbil to its learning rate and how detailed balance can remove it

  • J. L. Shapiro
  • Foundations of Genetic Algorithms
  • 2003
Highly Influential
17 Excerpts

Bayesian optimization algorithm : From single level to hierarchy

  • M. Pelikan
  • 2002
2 Excerpts

Bayesian optimization algorithm: From single level to hierarchy. PhD thesis, University of Illinois at Urbana-Champaign, Urbana, IL

  • M. Pelikan
  • 2002
3 Excerpts

Similar Papers

Loading similar papers…