Why one must use reweighting in estimation of distribution algorithms

Proceedings of the 11th Annual Genetic and Evolutionary Computation Conference, GECCO-2009

Volumn , Issue , 2009, Pages 453-460

  Teytaud, Fabien ^a   Teytaud, Olivier ^a  

^a UFR 919 Laboratoire d'Informatique Pour la Mécanique et les Sciences de l'Ingénieur   (France)

Author keywords

Estimation of distribution algorithms; Premature convergence; Reweighting

Indexed keywords

ESTIMATION OF DISTRIBUTION ALGORITHMS; PREMATURE CONVERGENCE; SIMPLE MODIFICATIONS; UNBIASED ESTIMATES;

CONVERGENCE OF NUMERICAL METHODS; ESTIMATION;

EVOLUTIONARY ALGORITHMS;

EID: 72749121071     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1569901.1569964     Document Type: Conference Paper

References (29)

1. Literary digest, 1936.
2. K. Andersen. The Creation of a Democratic Majority: 1928-1936.
3. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning,. Technical Report CMU-CS-94-163, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, 1994.
4. Y. Cai, X. Sun, H. Xu, and P. Jia. Cross entropy and adaptive variance scaling in continuous eda. In GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pages 609-616, New York, NY, USA, 2007. ACM.
5. D. R. Cox and W. L. Smith. Queues. Methuen/Wiley, London, 1961.
6. L. Devroye, L. Györfi, and G. Lugosi. A probabilistic Theory of Pattern Recognition. Springer, 1997.
7. B. Efron and R. Tibshirani. An introduction to the bootstrap, volume 57 of Monographs on Statistic and Applied Probability. Chapman & Hall, 1993.
8. S. Gelly, J. Mary, and O. Teytaud. On the ultimate convergence rates for isotropic algorithms and the best choices among various forms of isotropy. In 10th International Conference on Parallel Problem Solving from Nature (PPSN 2006), 2006.
9. J. Grahl, P. A. Bosman, and F. Rothlauf. The correlation-triggered adaptive variance scaling idea. In GECCO '06: Proceedings of the 8th annual conference on Genetic and evolutionary computation, pages 397-404, New York, NY, USA, 2006. ACM.
10. D. Gross and C. L. Harris. Fundamentals of Queueing Theory. Wiley & Sons, New York, 1974.
11. G. R. Harik, F. G. Lobo, and D. E. Goldberg. The compact genetic algorithm. IEEE Trans. on Evolutionary Computation, 3(4):287, November 1999.
12. P. Larranaga and J. A. Lozano. Estimation of Distribution Algorithms. A New Tool for Evolutionary Computation. Kluwer Academic Publishers, 2001.
13. P. L'Ecuyer and C. Lemieux. Recent Advances in Randomized Quasi-Monte Carlo Methods, pages 419-474. Kluwer Academic, 2002.
14. J. Liu and H.-F. Teng. Model learning and variance control in continuous edas using pca. In ICICIC '08: Proceedings of the 2008 3rd International Conference on Innovative Computing Information and Control, page 555, Washington, DC, USA, 2008. IEEE Computer Society.
15. B. J. Morgan. Elements of simulation. Chapman & Hall, Ltd., London, UK, UK, 1984.
16. H. Mühlenbein and R. Höns. The estimation of distributions and the minimum relative entropy principle. Evolutionary Computation, 13(1):1-27, 2005.
17. H. Mühlenbein and T. Mahnig. Evolutionary computation and Wright's equation. Theoretical Computer Science, 287(1):145-165, 2002.
18. H. Niederreiter. Random Number Generation and Quasi-Monte Carlo Methods. 1992.
19. A. B. Owen. Quasi-Monte Carlo sampling. In H. W. Jensen, editor, Monte Carlo Ray Tracing: Siggraph 2003 Course 44, pages 69-88. SIGGRAPH, 2003.
20. P. Pos?́k. Preventing premature convergence in a simple eda via global step size setting. In PPSN, pages 549-558, 2008.
21. A. Salmerón and S. Moral. Importance sampling in bayesian networks using antithetic variables. In ECSQARU '01: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, pages 168-179, London, UK, 2001. Springer-Verlag.
22. L. W. Schruben and B. H. Margolin. Pseudorandom number assignment in statistically designed simulation and distribution sampling experiments. Journal of the American Statistical Association, 73:504-525, 1978.
23. J. L. Shapiro. Drift and scaling in estimation of distribution algorithms. Evolutionary Computation, 13(1), 2005.
24. I. Sloan and H. Wózniakowski. When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? Journal of Complexity, 14(1):1-33, 1998.
25. O. Teytaud. Conditionning, halting criteria and choosing lambda. In EA07, Tours France, 2007. G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS, G.: Mathematics of Computing/G.1: NUMERICAL ANALYSIS/G.1.6: Optimization.
26. O. Teytaud. When does quasi-random work?. In G. Rudolph, T. Jansen, S. M. Lucas, C. Poloni, and N. Beume, editors, PPSN, volume 5199 of Lecture Notes in Computer Science, pages 325-336. Springer, 2008.
27. O. Teytaud and S. Gelly. DCMA: yet another derandomization in covariance-matrix-adaptation. In GECCO '07: Proceedings of the 9th annual conference on Genetic and evolutionary computation, pages 955-963, New York, NY, USA, 2007. ACM.
28. A. van der Vaart and J. Wellner. Weak Convergence and Empirical Processes, With Applications to Statistics. Springer Series in Statistics. Springer-Verlag New York, Inc., 1996.
29. S. Yakowitz, J. E. Krimmel, and F. Szidarovszky. Weighted monte carlo integration. SIAM Journal on Numerical Analysis, 15(6):1289-1300, 1978.