Scalability of the Bayesian optimization algorithm
24 November 2003Pelikan, M., Sastry, K., Goldberg, D. E. (2003). International Journal of Approximate Reasoning, 31(3), 221—258. [Full paper - PDF] [Full paper - PS].
Abstract:
- To solve a wide range of different problems, the research in black-box optimization faces several important challenges. One of the most important challenges is the design of methods capable of automatically discovering the regularities in the problem and utilizing these to ensure efficient and reliable search. This paper discusses the Bayesian optimization algorithm (BOA) that uses Bayesian networks to model promising solutions and guide exploration of the search space. Using Bayesian networks in combination with population-based genetic and evolutionary search allows the algorithm to discover and utilize regularities in the form of problem decomposition. The paper analyzes the applicability of the methods for learning Bayesian networks in context of genetic and evolutionary search. In particular, the population sizing ensuring that BOA learns a proper decomposition of the problem is analyzed. The paper concludes that the combination of the two approaches in BOA yields a robust, efficient, and accurate search.
Posted in Estimation of Distribution Algorithms, Genetic and Evolutionary Algorithm Theory, Journals, Publications |
Trackback |
Top Of Page
Related Posts:
- Bayesian optimization algorithm, decision graphs, and Occam’s razor
- iBOA: The incremental Bayesian optimization algorithm
- Evolutionary algorithms + graphical models = scalable black-box optimization
- Multiojbective hBOA, clustering, and scalability
- Fitness inheritance in the Bayesian optimization algorithm
Comments are closed.
