Addressing sampling errors and diversity loss in UMDA

Proceedings of GECCO 2007: Genetic and Evolutionary Computation Conference

Volumn , Issue , 2007, Pages 508-515

  Branke, Juergen ^a   Lode, Clemens ^a   Shapiro, Jonathan L ^b  

^a UNIVERSITY OF KARLSRUHE   (Germany)

^b UNIVERSITY OF MANCHESTER   (United Kingdom)

Author keywords

Sampling error; UMDA; Variance loss

Indexed keywords

DISTRIBUTION FUNCTIONS; LOGIC PROGRAMMING; MODEL CHECKING; PARAMETER ESTIMATION; PROBABILISTIC LOGICS;

MODEL CONSTRUCTION; SAMPLING ERRORS; UNIVARIATE MARGINAL DISTRIBUTION ALGORITHM (UMDA); VARIANCE LOSS;

EVOLUTIONARY ALGORITHMS;

EID: 34548060410     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1276958.1277068     Document Type: Conference Paper

References (13)

1. J. E. Baker. Reducing bias and inefficiency in the selection algorithm. In J. Grefenstette, editor, International Conference on Genetic Algorithms, pages 14-21. Lawrence Erlbaum Associates, 1987.
2. S. Baluja and S. Davies. Using optimal dependency-trees for combinatorial optimization: Learing the structure of the search space. In D. Fisher, editor, International Conference on Machine Learning, pages 30-38, 1997.
3. J. Branke, M. Cutaia, and H. Dold. Reducing genetic drift in steady state evolutionary algorithms. In Wolfgang Banzhaf et al., editors, Genetic and Evolutionary Computation Conference, pages 68-74. Morgan Kaufmann, 1999.
4. C. Gonzalez, J. Lozano, and P. Larrañaga. Analyzing the population based incremental learning algorithm by means of discrete dynamical systems. Complex Systems, 12(4):465-479, 2001.
5. C. Gonzalez, J. Lozano, and P. Larrañaga. The convergence behaviour of the PBIL algorithm: a preliminary approach. In International Conference on Neural Networks and Genetic Algorithms, pages 228-231, 2001.
6. P. Larrañaga and J. A. Lozano. Estimation of Distribution Algorithms, A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2002.
7. T. Mahnig and H. Mühlenbein. Optimal mutation rate using bayesian priors for estimation of distribution algorithms. In Stochastic Algorithms: Foundations and Applications, volume 2264 of LNCS, 2001.
8. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions i: Binary parameters. In Parallel Problem Solving from Nature, pages 178-187, 1999.
9. M. Pelikan, D. E. Goldberg, and F. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
10. J. L. Shapiro. Scaling of probability-based optimization algorithms. In Klaus Obermayer, editor, Advances in Neural Information Processing Systems 15, pages 399-406. MIT Press, 2003.
11. J. L. Shapiro. The detailed balance principle in estimation of distribution algorhithm. Evolutionary Computation, 13(1):99-124, 2005.
12. J. L. Shapiro. Diversity loss in general estimation of distribution algorithms. In Parallel Problem Solving from Nature, volume 4193 of LNCS, pages 92-101. Springer, 2006.
13. H. Wu and J. L. Shapiro. Does overfitting affect performance in estimation of distribution algorithms. In Genetic and Evolutionary Computation Conference, pages 433-434. ACM, 2006.