Scalability of the Bayesian optimization algorithm.

DOI10.1016/S0888-613X(02)00095-6zbMath1065.90084OpenAlexW2057757994MaRDI QIDQ1399504

Martin Pelikan, Kumara Sastry, Devid E. Goldberg

Publication date: 30 July 2003

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0888-613x(02)00095-6

zbMATH Keywords

algorithmdecompositiongraphical modelsprobabilisticblack-box optimizationBayesian optimizationGenetic and evolutionary computationmodel-building genetic algorithms

Mathematics Subject Classification ID

Bayesian problems; characterization of Bayes procedures (62C10) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Bayesian Estimation and Optimization for Learning Sequential Regularized Portfolios ⋮ On the limitations of classical benchmark functions for evaluating robustness of evolutionary algorithms ⋮ Learning Structure Illuminates Black Boxes – An Introduction to Estimation of Distribution Algorithms ⋮ Population sizing for inductive linkage identification

Cites Work

• Modeling by shortest data description
• A Bayesian method for the induction of probabilistic networks from data
• Estimating the dimension of a model
• Schemata, distributions and graphical models in evolutionary optimization
• Learning Bayesian networks: The combination of knowledge and statistical data
• Fisher information and stochastic complexity
• A survey of optimization by building and using probabilistic models
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item