Scalability of the Bayesian optimization algorithm.

DOI10.1016/S0888-613X(02)00095-6MaRDI QIDQ1399504zbMATH OpenOpenAlexFDO

Authors Martin Pelikan, Kumara Sastry, David 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

probabilisticdecompositiongraphical modelsalgorithmblack-box optimizationBayesian optimizationGenetic and evolutionary computationmodel-building genetic algorithms

Mathematics Subject Classification ID

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

Recommendations

• Scalable optimization via probabilistic modeling. From algorithms to applications.
• scientific article; zbMATH DE number 4100966
• Bayesian optimization
• Bayesian Optimization with Expensive Integrands
• scientific article; zbMATH DE number 4174179
• An improved Bayesian optimization algorithm with fast convergence
• Bayesian methods in global optimization
• Bayesian and High-Dimensional Global Optimization
• Bayesian optimization and genericity

Cites work

• scientific article; zbMATH DE number 1702339 (Why is no real title available?)
• scientific article; zbMATH DE number 45100 (Why is no real title available?)
• scientific article; zbMATH DE number 98525 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 1222293 (Why is no real title available?)
• scientific article; zbMATH DE number 2038821 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• A Bayesian method for the induction of probabilistic networks from data
• A survey of optimization by building and using probabilistic models
• Estimating the dimension of a model
• Fisher information and stochastic complexity
• Large-sample learning of Bayesian networks is NP-hard
• Learning Bayesian networks: The combination of knowledge and statistical data
• Modeling by shortest data description
• Schemata, distributions and graphical models in evolutionary optimization

Cited in

(13)

• Population sizing for inductive linkage identification
• Automatic generation of algorithms for robust optimisation problems using grammar-guided genetic programming
• scientific article; zbMATH DE number 1881948 (Why is no real title available?)
• Hierarchical Bayesian optimization algorithm
• Scalability of using restricted Boltzmann machines for combinatorial optimization
• A hill-climbing and pattern ant colony hybrid Bayesian optimization algorithm
• 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
• Linkage Learning Accuracy in the Bayesian Optimization Algorithm
• Introducing assignment functions to Bayesian optimization algorithms
• Hierarchical Bayesian optimization algorithm. Toward a new generation of evolutionary algorithms. With a foreword by David E. Goldberg
• Bayesian Estimation and Optimization for Learning Sequential Regularized Portfolios
• scientific article; zbMATH DE number 2040650 (Why is no real title available?)

This page was built for publication: Scalability of the Bayesian optimization algorithm.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1399504)