IBOA: The incremental Bayesian optimization algorithm

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 455-462

  Pelikan, Martin ^a   Sastry, Kumara ^b   Goldberg, David E ^b  

^a UNIVERSITY OF MISSOURI ST LOUIS   (United States)

^b University of Illinois at Urbana Champaign   (United States)

Author keywords

Algorithms

Indexed keywords

BAYESIAN OPTIMIZATION ALGORITHMS; ESTIMATION OF DISTRIBUTION ALGORITHMS; INCREMENTAL TECHNIQUES; INCREMENTAL UPDATES; NEARLY DECOMPOSABLE; PROBABILISTIC MODELS;

DISTRIBUTED PARAMETER NETWORKS; EVOLUTIONARY ALGORITHMS; INFERENCE ENGINES; INTELLIGENT NETWORKS; OPTIMIZATION; PROBABILITY DISTRIBUTIONS; SPEECH ANALYSIS; SPEECH RECOGNITION;

BAYESIAN NETWORKS;

EID: 57349156955     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (34)

1. D. H. Ackley. An empirical study of bit vector function optimization. Genetic Algorithms and Simulated Annealing, pages 170-204, 1987.
2. S. Baluja. Population-based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Tech. Rep. No. CMU-CS-94-163, Carnegie Mellon University, Pittsburgh, PA, 1994.
3. S. Baluja and S. Davies. Using optimal dependency-trees for combinatorial optimization: Learning the structure of the search space. Proceedings of the International Conference on Machine Learning, pages 30-38, 1997.
4. P. A. N. Bosman and D. Thierens. Linkage information processing in distribution estimation algorithms. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), I:60-67, 1999.
5. D. M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. Technical Report MSR-TR-97-07, Microsoft Research, Redmond, WA, 1997.
6. C. Chow and C. Liu. Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462-467, 1968.
7. K. Deb and D. E. Goldberg. Analyzing deception in trap functions. IlliGAL Report No. 91009, Illinois Genetic Algorithms Laboratory, Urbana, IL, 1991.
8. R. Etxeberria and P. Larrañaga. Global optimization using Bayesian networks, In A. A. O. Rodriguez, M. R. S. Ortiz, and R. S. Hermida, editors, Second Symposium on Artificial Intelligence (CIMAF-99), pages 332-339, Habana, Cuba, 1999. Institude of Cybernetics, Mathematics, and Physics and Ministry of Science, Technology and Environment.
9. N. Friedman and M. Goldszmidt. Learning Bayesian networks with local structure. In M. I. Jordan, editor, Graphical models, pages 421-459. MIT Press, Cambridge, MA, 1999.
10. D. E. Goldberg. The design of innovation: Lessons from and for competent genetic algorithms, volume 7 of Genetic Algorithms and Evolutionary Computation, Kluwer Academic Publishers, 2002.
11. D. E. Goldberg, K. Sastry, and X. Llorà. Toward routine billion-variable optimization using genetic algorithms. Complexity, 12(3):27-29, 2007.
12. P. Grünwald. The Minimum Description Length Principle and Reasoning under Uncertainty, PhD thesis, University of Amsterdam, Amsterdam, Netherlands, 1998.
13. G. R. Harik, F. G. Lobo, and D. E. Goldberg, The compact genetic algorithm. Proceedings of the International Conference on Evolutionary Computation (ICEC-98), pages 523-528, 1998.
14. D. Heckerman, D. Geiger, and D. M. Chickering. Learning Bayesian networks: The combination of knowledge and statistical data. Technical Report MSR-TR-94-09, Microsoft Research, Redmond, WA. 1994.
15. M. Henrion. Propagating uncertainty in Bayesian networks by probabilistic logic sampling. In J. F. Lemmer and L. N. Kanal, editors, Uncertainty in Artificial Intelligence, pages 149-163. Elsevier, Amsterdam, London, New York, 1988.
16. R. A. Howard and J. E. Matheson. Influence diagrams. In R. A. Howard and J. E. Matheson, editors, Readings on the principles and applications of decision analysis, volume II, pages 721-762, Strategic Decisions Group, Menlo Park, CA, 1981,
17. A. Juels, S. Baluja, and A. Sinclair. The equilibrium genetic algorithm and the role of crossover, 1993.
18. P. Larrañaga and J. A. Lozano, editors. Estimation of Distribution Algorithms: A New Tool for Evolutionary Computation. Kluwer, Boston, MA. 2002,
19. J. A. Lozano, P. Larrañaga, I. Inza, and E, Bengoetxea, editors. Towards a New Evolutionary Computation: Advances on Estimation of Distribution Algorithms. Springer, 2006.
20. H. Mühlenbein and T. Mahnig, FDA - A scalable evolutionary algorithm for the optimization of additively decomposed functions. Evolutionary Computation, 7(4):353-376, 1999.
21. H. Mühlenbein and G. Paaß. From recombination of genes to the estimation of distributions I. Binary parameters. Parallel Problem Solving from Nature, pages 178-187, 1996.
22. 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.
23. J. Pearl. Probabilistic reasoning in intelligent systems: Networks of plausible inference. Morgan Kaufmann, San Mateo, CA, 1988.
24. M. Pelikan, Hierarchical Bayesian optimization algorithm: Toward a new generation of evolutionary algorithms. Springer, 2005.
25. M. Pelikan and D. E. Goldberg. Hierarchical Bayesian optimization algorithm. In M. Pelikan, K. Sastry, and E. Cantú-Paz, editors, Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications, Springer, 2006.
26. M. Pelikan, D. E. Goldberg, and E. Cantú-Paz, BOA: The Bayesian optimization algorithm. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-99), I:525-532, 1999.
27. M. Pelikan, K. Sastry, and E. Cantú-Paz, editors. Scalable optimization via probabilistic modeling: From algorithms to applications, Springer-Verlag, 2006.
28. M. Pelikan, K. Sastry, and D. E. Goldberg. Scalability of the Bayesian optimization algorithm, International Journal of Approximate Reasoning, 31(3):221-258, 2002.
29. R. Prim, Shortest connection networks and some generalizations. Bell Systems Technical Journal, 36:1389-1401, 1957.
30. K. Sastry, Evaluation-relaxation schemes for genetic and evolutionary algorithms. Master's thesis, University of Illinois at Urbana-Champaign, Department of General Engineering, Urbana, IL. 2001.
31. K. Sastry, D. E. Goldberg, and X. Llorà, Towards billion bit optimization via efficient genetic algorithms, IlliGAL Report No, 2007007, University of Illinois at Urbana-Champaign, Illinois Genetic Algorithms Laboratory, Urbana, IL. 2007.
32. G. Schwarz. Estimating the dimension of a model. The Annals of Statistics, 6:461-464, 1978.
33. D. Thierens, Scalability problems of simple genetic algorithms, Evolutionary Computation, 7(4):331-352, 1999.
34. D. Thierens, D. E. Goldberg, and A. G. Pereira. Domino convergence, drift, and the temporal-salience structure of problems. Proceedings of the International Conference on Evolutionary Computation (ICEC-98), pages 535-540, 1998.