Spurious dependencies and EDA scalability

Proceedings of the 12th Annual Genetic and Evolutionary Computation Conference, GECCO '10

Volumn , Issue , 2010, Pages 303-310

  Radetic, Elizabeth ^a   Pelikan, Martin ^a  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

Author keywords

Algorithms; Performance

Indexed keywords

ESTIMATION OF DISTRIBUTION ALGORITHMS; PERFORMANCE; POPULATION SIZING; PRODUCT MODELS; REPLACEMENT STRATEGY; THEORETICAL MODELS;

SCALABILITY;

EVOLUTIONARY ALGORITHMS;

EID: 77955909871     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1830483.1830543     Document Type: Conference Paper

References (36)

1. S. Bahija andS. Davies. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. International Conference on Machine Learning, pages 30-38, 1997.
2. J. S. De Bonet, C. L. Isbell, andP. Viola. MIMIC: Finding optima by estimating probability densities. Advances in neural information processing systems (NIPS-97), 9:424-431, 1997.
3. W. Feller. An introduction to probability theory and its applications. Wiley, New York, NY, 1970.
4. D. E. Goldberg. Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading, MA, 1989.
5. D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms, volume 7 of Genetic Algorithms and Evolutionary Computation. Kluwer, 2002.
6. D. E. Goldberg, K. Deb, and J. H. Clark. Genetic algorithms, noise, and the sizing of populations. Complex Systems, 6:333-362, 1992.
7. D. E. Goldberg, K. Sastry, andT. Latoza. On the supply of building blocks. Genetic and Evolutionary Comp. Conf. (GECCO-2001), pages 336-342, 2001.
8. G. Harik. Linkage learning via probabilistic modeling in the ECGA. IlliGAL Report No. 99010, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1999.
9. G. Harik, E. Cantú-Paz, D. E. Goldberg, andB. L. Miller. The gambler's ruin problem, genetic algorithms, and the sizing of populations. Evolutionary Computation, 7(3):231-253, 1999.
10. G. R. Harik. Finding multimodal solutions using restricted tournament selection. International Conf. on Genetic Algorithms (ICGA-95), pages 24-31, 1995.
11. G. R. Harik, F. G. Lobo, andD. E. Goldberg. The compact genetic algorithm. International Conf. on Evolutionary Computation (ICEC-98), pages 523-528, 1998.
12. M. Hauschild, M. Pelikan, C. F. Lima, andK. Sastry. Analyzing probabilistic models in hierarchical BOA on traps and spin glasses. Genetic and Evolutionary Computation Conf. (GECCO-2007), pages 523-530, 2007.
13. J. Holland. Genetic algorithms and the optimal allocation of trials. SIAM Journal of Computing, 2(2):88-105, 1973.
14. J. H. Holland. Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI, 1975.
15. P. Larrañaga andJ. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA, 2002.
16. C. Lima, F. G. Lobo, andM. Pelikan. From mating pool distributions to model overfitting. Genetic and Evolutionary Computation Conf. (GECCO-2008), pages 431-438, 2008.
17. C. F. Lima, M. Pelikan, D. E. Goldberg, F. Lobo, K. Sastry, andM. Hauschild. Influence of selection and replacement strategies on linkage learning in BOA. Int. Conf. on Evolutionary Computation (CEC-2007), pages 1083-1090, 2007.
18. C. F. Lima, M. Pelikan, K. Sastry, M. V. Butz, andD. E. Goldberg. Substructural neighborhoods for local search in the Bayesian optimization algorithm. Parallel Problem Solving from Nature, pages 232-241, 2006.
19. F. G. Lobo, K. Sastry, andG. R. Harik. Extended compact genetic algorithm in C++, version 1.1. IlliGAL Report No. 2006012, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL, 2006.
20. H. Mühlenbein andG. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187, 1996.
21. H. Mühlenbein and D. Schlierkamp-Voosen. Predictive models for the breeder genetic algorithm: I. Continuous \ parameter optimization. Evolutionary Computation, 1(1):25-49, 1993.
22. M. Pelikan. Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer-Verlag, 2005.
23. M. Pelikan, D. E. Goldberg, andE. Cantú-Paz. BOA: The Bayesian optimization algorithm. Genetic and Evolutionary Computation Conf. (GECCO-99), 1:525-532, 1999.
24. M. Pelikan, D. E. Goldberg, andF. Lobo. A survey of optimization by building and using probabilistic models. Computational Optimization and Applications, 21(1):5-20, 2002.
25. M. Pelikan andH. Mühlenbein. The bivariate marginal distribution algorithm. Advances in Soft Computing - Engineering Design and Manufacturing, pages 521-535, 1999.
26. M. Pelikan, K. Sastry, andD. E. Goldberg. Scalability of the Bayesian optimization algorithm. International Journal of Approximate Reasoning, 31(3):221-258, 2002.
27. R. Santana, P. Larranaga, andJ. A. Lozano. Interactions and dependencies in estimation of distribution algorithms. IEEE Congress on Evolutionary Computation (CEC-05), pages 1418-1425, 2005.
28. K. Sastry. Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, 2001.
29. K. Sastry andD. E. Goldberg. On extended compact genetic algorithm. In Late Breaking Paper in Genetic and Evol. Comp. Conf. (GECCO-2000), pages 352-359, 2000.
30. H. A. Simon. The Sciences of the Artificial. The MIT Press, Cambridge, MA, 1968.
31. D. Thierens. Analysis and design of genetic algorithms. PhD thesis, Katholieke Universiteit Leuven, Leuven, Belgium, 1995.
32. D. Thierens. Scalability problems of simple genetic algorithms. Evolutionary Computation, 7(4):331-352, 1999.
33. H. Wu andJ. L. Shapiro. Does overfitting affect performance in estimation of distribution algorithms. Genetic and Evolutionary Computation Conf. (GECCO-W06), pages 433-434, 2006.
34. T.-L. Yu andD. E. Goldberg. Toward an understanding of the quality and efficiency of model building for genetic algorithms. Genetic and Evolutionary Computation Conf. (GECCO-2004), pages 367-378, 2004.
35. T.-L. Yu, K. Sastry, andD. E. Goldberg. Linkage learning, overlapping building blocks, and systematic strategy for scalable recombination. Genetic and Evolutionary Computation Conf. (GECCO-2005), pages 1217-1224, 2005.
36. T.-L. Yu, K. Sastry, D. E. Goldberg, andM. Pelikan. Population sizing for entropy-based model building in estimation of distribution algorithms. Genetic and Evolutionary Computation Conf. (GECCO-2007), pages 601-608, 2007.