Abstract
The Bayesian Optimization Algorithm (BOA) uses a Bayesian network to estimate the probability distribution of promising solutions to a given optimization problem. This distribution is then used to generate new candidate solutions. The objective is to improve the population of candidate solutions by learning and sampling from good solutions. A Bayesian network (BN) is a graphical representation of a probability distribution over a set of variables of a given problem domain. The number of topological states that a BN can create depends on a parameter called maximum allowed indegree. We show that the value of the maximum allowed indegree given to the Bayesian network used by the BOA strongly affects the performance of this algorithm. Furthermore, there is a limited set of values for this parameter for which the performance of the BOA is maximized.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Berthier, L., Young, A.P.: Time and length scales in spin glasses. Journal of Physics: Condensed Matter 16, 729–734 (2004)
Borgelt, C., Kruse, R.: An empirical investigation of the k2 metric. In: Proceedings of the 6th European Conference on Symbolic and Quantitative Approaches to Reasoning and Uncertainty, Toulouse, France, pp. 240–251. Springer, Heidelberg (2001)
Bouckaert, R.R.: Properties of Bayesian belief network learning algorithms. In: de Mantaras, R.L., Poole, D. (eds.) Proceedings of the 10th Conference on Uncertainty in Artificial Intelligence, Seattle, WA, USA, pp. 102–109. Morgan Kaufmann, San Francisco (1994)
Chickering, D.M., Geiger, D., Heckerman, D.: Learning Bayesian networks is NP-hard. Technical Report MSR-TR-94-17, Microsoft Research (November 1994)
Cook, S.A.: The complexity of theorem proving procedures. In: Proceedings of the third Annual ACM Symposium on Theory of Computing, Shaker Heights, Ohio, USA, May 1971, pp. 151–158 (1971)
Cooper, G.F., Herskovits, E.: A Bayesian method for induction of probabilistic networks from data. Technical Report SMI-91-01, University of Pittsburgh, Pittsburgh, PA, USA (January 1991)
Gent, I.P., Walsh, T.: An empirical analysis of search in GSAT. Artificial Intelligence Research 1, 47–59 (1993)
Gu, J., Pardalos, P., Du, D.-Z.: Satisfiability problem: theory and applications. Dimacs Series in Discrete Mathematics and Theoretical Computer Science, vol. 35. American Mathematical Society (October 1997)
Jensen, F.V.: Bayesian networks and decision graphs, 1st edn. Springer, Heidelberg (2001)
Mitchell, D.G., Selman, B., Levesque, H.J.: Hard and easy distributions for SAT problems. In: Rosenbloom, P., Szolovits, P. (eds.) Proceedings of the tenth National Conference on Artificial Intelligence, pp. 459–465. AAAI Press, Menlo Park (1992)
Pearl, J.: Probabilistic reasoning in intelligent systems: networks of plausible inference, 1st edn. Morgan Kaufmann, San Francisco (1988)
Pelikan, M.: Bayesian optimization algorithm: from single level to hierarchy. PhD thesis, Department of Computer Science at the University of Illinois at Urbana-Champaign, Urbana-Champaign, IL, USA (2002)
Pelikan, M., Goldberg, D.E.: Research on the Bayesian optimization algorithm. In: Wu, A.S. (ed.) Workshop of the Genetic and Evolutionary Computation Conference - GECCO 2000, Las Vegas, NV, USA, pp. 216–219. Morgan Kaufmann, San Francisco (2000)
Pelikan, M., Goldberg, D.E., Cantú-Paz, E.: BOA: the Bayesian optimization algorithm. In: Banzhaf, W., Daida, J., Eiben, A.E., Garzon, M.H., Honavar, V., Jakiela, M., Smith, R.E. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference GECCO 1999, Orlando, Florida, USA, vol. 1, pp. 525–532. Morgan Kaufmann, San Francisco (1999)
Pennock, D.M., Stout, Q.F.: Exploiting a theory of phase transitions in three-satisfiability problems. In: Proceedings of the 13th National Conference on Artificial Intelligence (AAAI 1996), Portland, OR, USA, August 1996, pp. 253–258 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Correa, E.S., Shapiro, J.L. (2006). Model Complexity vs. Performance in the Bayesian Optimization Algorithm. In: Runarsson, T.P., Beyer, HG., Burke, E., Merelo-Guervós, J.J., Whitley, L.D., Yao, X. (eds) Parallel Problem Solving from Nature - PPSN IX. PPSN 2006. Lecture Notes in Computer Science, vol 4193. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11844297_101
Download citation
DOI: https://doi.org/10.1007/11844297_101
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-38990-3
Online ISBN: 978-3-540-38991-0
eBook Packages: Computer ScienceComputer Science (R0)