Scalability of the Bayesian optimization algorithm Export

@article{citeulike:4930645, 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 automatic discovery and exploitation of problem regularities to ensure efficient and reliable search for the optimum. This paper discusses the Bayesian optimization algorithm (BOA), which uses Bayesian networks to model promising solutions and sample new candidate solutions. Using Bayesian networks in combination with population-based genetic and evolutionary search allows BOA to discover and exploit regularities in the form of a problem decomposition. The paper analyzes the applicability of the methods for learning Bayesian networks in the context of genetic and evolutionary search and concludes that the combination of the two approaches yields robust, efficient, and accurate search.}, author = {Pelikan, M.}, citeulike-article-id = {4930645}, citeulike-linkout-0 = {http://dx.doi.org/10.1016/S0888-613X(02)00095-6}, citeulike-linkout-1 = {http://linkinghub.elsevier.com/retrieve/pii/S0888-613X(02)00095-6}, doi = {10.1016/S0888-613X(02)00095-6}, issn = {0888613X}, journal = {International Journal of Approximate Reasoning}, keywords = {algorithm, bayesian, boa, eda, optimzation, population, sampling, sizing}, month = {November}, number = {3}, pages = {221--258}, posted-at = {2009-06-23 06:54:41}, priority = {2}, title = {Scalability of the Bayesian optimization algorithm}, url = {http://dx.doi.org/10.1016/S0888-613X(02)00095-6}, volume = {31}, year = {2002} }

TY - JOUR ID - citeulike:4930645 L3 - citeulike-article-id:4930645 N2 - 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 automatic discovery and exploitation of problem regularities to ensure efficient and reliable search for the optimum. This paper discusses the Bayesian optimization algorithm (BOA), which uses Bayesian networks to model promising solutions and sample new candidate solutions. Using Bayesian networks in combination with population-based genetic and evolutionary search allows BOA to discover and exploit regularities in the form of a problem decomposition. The paper analyzes the applicability of the methods for learning Bayesian networks in the context of genetic and evolutionary search and concludes that the combination of the two approaches yields robust, efficient, and accurate search. IS - 3 JF - International Journal of Approximate Reasoning SN - 0888613X EP - 258 TI - Scalability of the Bayesian optimization algorithm VL - 31 SP - 221 KW - algorithm KW - bayesian KW - boa KW - eda KW - optimzation KW - population KW - sampling KW - sizing AU - Pelikan, M PY - 2002/11// UR - http://dx.doi.org/10.1016/S0888-613X(02)00095-6 ER -