The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Bayesian Optimization
Abstract
In numerical analysis, this problem is typically called (global) optimization and has been the subject of decades of study. We draw a distinction between global optimization, where we seek the absolute optimum in X , and local optimization, where we seek to nd a local optimum in the neighborhood of a given initial point x0. A common approach to optimization problems is to make some assumptions about f . For example, when the objective function f is known to be convex and the domain X is also convex, the problem is known as convex optimization and has been widely studied. Convex optimization is a common tool used across machine learning.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Gelman, A., Carlin, J. B., Stern, H. S., & Rubin, D. B. (2003) · doi:10.1201/9780429258480 · Cited by 27,276
Reinforcement Learning: An Introduction
Sutton, R. S., & Barto, A. G. (1998) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.1998.712192 · Cited by 27,225
Advances in Neural Information Processing Systems 29
Teymur, O., Zygalakis, K., & Calderhead, B. (2016) · Cited by 13,881
Advances in Neural Information Processing Systems 25
Zhang, Y., Sutton, C. A., Storkey, A., & Zoubin Ghahramani, A. (2012) · Cited by 12,653
A Stochastic Approximation Method
Robbins, H., & Monro, S. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729586 · Cited by 9,643
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
On the limited memory BFGS method for large scale optimization
Liu, D. C., & Nocedal, J. (1989) · Mathematical Programming · doi:10.1007/bf01589116 · Cited by 8,560
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
Statistical Decision Theory and Bayesian Analysis
Berger, J. O. (1985) · Springer Series in Statistics · doi:10.1007/978-1-4757-4286-2 · Cited by 7,722
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494218 · Cited by 6,049
Proceedings of the 19th International Joint Conference on Artificial Intelligence
Pujol, J. M., Delgado, J., Ramon Sangüesa, A., & Flache, A. (2005) · International Joint Conference on Artificial Intelligence · Cited by 5,771
Engineering Design via Surrogate Modelling: A Practical Guide
Forrester, A. I. J., Sóbester, A., & Keane, A. J. (2008) · doi:10.1002/9780470770801 · Cited by 2,309
Proceedings of the 19th International Conference on Artificial Intelligence and Statistics 2016
Murray, I., & Graham, M. M. (2016) · Cited by 2,115
Proceedings of The 32nd International Conference on Machine Learning
Germain, M., Gregor, K., Murray, I., & Larochelle, H. (2015) · Cited by 2,020
Brochu, E., Cora, V. M., & de Freitas, N. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.2599 · Cited by 2,011
Stochastic Gradient Descent Tricks
Bottou, L. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_25 · Cited by 1,929
Approximate Dynamic Programming: Solving the Curses of Dimensionality
Powell, W. B. (2007) · Wiley Series in Probability and Statistics · doi:10.1002/9780470182963 · Cited by 1,566
Neal, R. M. (2003) · The Annals of Statistics · doi:10.1214/aos/1056562461 · Cited by 1,361
Knowles, J. (2006) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2005.851274 · Cited by 1,254
Envelope Theorems for Arbitrary Choice Sets
Milgrom, P., & Segal, I. (2002) · Econometrica · doi:10.1111/1468-0262.00296 · Cited by 1,235
A New Method of Locating the Maximum Point of an Arbitrary Multipeak Curve in the Presence of Noise
Kushner, H. J. (1964) · Journal of Basic Engineering · doi:10.1115/1.3653121 · Cited by 1,082
Multi-fidelity optimization via surrogate modelling
Forrester, A. I. J., Sóbester, A., & Keane, A. J. (2007) · Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.2007.1900 · Cited by 1,018
Elements of Information Theory
(2013) · Wireless Communications · doi:10.1002/9781118576618.ch7 · Cited by 999
A rigorous framework for optimization of expensive functions by surrogates
Booker, A. J., Dennis, J. E., Frank, P. D., Serafini, D. B., Torczon, V., & Trosset, M. W. (1999) · Structural Optimization · doi:10.1007/bf01197708 · Cited by 960
The Greatest of a Finite Set of Random Variables
Clark, C. E. (1961) · Operations Research · doi:10.1287/opre.9.2.145 · Cited by 708
Shan, S., & Wang, G. G. (2010) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-009-0420-2 · Cited by 597
Roustant, O., Ginsbourger, D., & Deville, Y. (2012) · Journal of Statistical Software · doi:10.18637/jss.v051.i01 · Cited by 594
Multidimensional Stochastic Approximation Methods
Blum, J. R. (1954) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177728659 · Cited by 523
Seko, A., Togo, A., Hayashi, H., Tsuda, K., Chaput, L., & Tanaka, I. (2015) · Physical Review Letters · doi:10.1103/physrevlett.115.205901 · Cited by 455
A Knowledge-Gradient Policy for Sequential Information Collection
Frazier, P. I., Powell, W. B., & Dayanik, S. (2008) · SIAM Journal on Control and Optimization · doi:10.1137/070693424 · Cited by 447
Self-citationSequential kriging optimization using multiple-fidelity evaluations
Huang, D., Allen, T. T., Notz, W. I., & Miller, R. A. (2006) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-005-0587-0 · Cited by 414
The Knowledge-Gradient Policy for Correlated Normal Beliefs
Frazier, P., Powell, W., & Dayanik, S. (2009) · INFORMS Journal on Computing · doi:10.1287/ijoc.1080.0314 · Cited by 408
Self-citationBayesian Approach to Global Optimization: Theory and Applications
Mockus, J. (1989) · Mathematics and Its Applications · doi:10.1007/978-94-009-0909-0 · Cited by 406
On Bayesian Methods for Seeking the Extremum
Močkus, J. (1975) · Optimization Techniques IFIP Technical Conference · doi:10.1007/978-3-662-38527-2_55 · Cited by 402
Kriging Is Well-Suited to Parallelize Optimization
Ginsbourger, D., Le Riche, R., & Carraro, L. (2010) · Adaptation Learning and Optimization · doi:10.1007/978-3-642-10701-6_6 · Cited by 396
Bayesian Optimization in a Billion Dimensions via Random Embeddings
Wang, Z., Hutter, F., Zoghi, M., Matheson, D., & De Feitas, N. (2016) · Journal of Artificial Intelligence Research · doi:10.1613/jair.4806 · Cited by 390
Sasena, M. J. (2002) · Cited by 350
Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions
Regis, R. G., & Shoemaker, C. A. (2005) · Journal of Global Optimization · doi:10.1007/s10898-004-0570-0 · Cited by 331
Proceedings of the 10th European conference on artificial intelligence
Siklóssy, L., & Tepandi, J. (1993) · Engineering Applications of Artificial Intelligence · doi:10.1016/0952-1976(93)90070-e · Cited by 327
Design and Analysis of Simulation Experiments
(2008) · International Series in Operations Research & Management Science · doi:10.1007/978-0-387-71813-2 · Cited by 317
Statistical Improvement Criteria for Use in Multiobjective Design Optimization
Keane, A. J. (2006) · AIAA Journal · doi:10.2514/1.16875 · Cited by 312
Most likely heteroscedastic Gaussian process regression
Kersting, K., Plagemann, C., Pfaff, P., & Burgard, W. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273546 · Cited by 311
COMBO: An efficient Bayesian optimization library for materials science
Ueno, T., Rhone, T. D., Hou, Z., Mizoguchi, T., & Tsuda, K. (2016) · Materials Discovery · doi:10.1016/j.md.2016.04.001 · Cited by 309
Designing Nanostructures for Phonon Transport via Bayesian Optimization
Ju, S., Shiga, T., Feng, L., Hou, Z., Tsuda, K., & Shiomi, J. (2017) · Physical Review X · doi:10.1103/physrevx.7.021024 · Cited by 270
Bayesian Optimization for Materials Design
Frazier, P. I., & Wang, J. (2016) · Springer Series in Materials Science · doi:10.1007/978-3-319-23871-5_3 · Cited by 228
Self-citationScott, W., Frazier, P., & Powell, W. (2011) · SIAM Journal on Optimization · doi:10.1137/100801275 · Cited by 209
Self-citationMahajan, A., & Teneketzis, D. (2008) · Foundations and Applications of Sensor Management · doi:10.1007/978-0-387-49819-5_6 · Cited by 185
Improved Strategies for Radial basis Function Methods for Global Optimization
Regis, R. G., & Shoemaker, C. A. (2006) · Journal of Global Optimization · doi:10.1007/s10898-006-9040-1 · Cited by 148
Hey, A. M. (1979) · Journal of the Operational Research Society · doi:10.1057/jors.1979.201 · Cited by 136
A parallel updating scheme for approximating and optimizing high fidelity computer simulations
Sbester, A., Leary, S., & Keane, A. J. (2004) · Structural and Multidisciplinary Optimization · doi:10.1007/s00158-004-0397-9 · Cited by 118
Lam, R., Allaire, D., & Willcox, K. E. (2015) · AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics, and Materials Conference (SDM) · doi:10.2514/6.2015-0143 · Cited by 105
Twenty Questions with Noise: Bayes Optimal Policies for Entropy Loss
Jedynak, B., Frazier, P. I., & Sznitman, R. (2012) · Journal of Applied Probability · doi:10.1239/jap/1331216837 · Cited by 90
Self-citationParallel radial basis function methods for the global optimization of expensive functions
Regis, R. G., & Shoemaker, C. A. (2006) · European Journal of Operational Research · doi:10.1016/j.ejor.2006.08.040 · Cited by 65
Chang, P. B., Williams, B. J., Bhalla, K. S. B., Belknap, T. W., Santner, T. J., Notz, W. I., & Bartel, D. L. (2001) · Journal of Biomechanical Engineering · doi:10.1115/1.1372701 · Cited by 61
Towards Gaussian Process-based Optimization with Finite Time Horizon
Ginsbourger, D., & Riche, R. L. (2010) · Contributions to statistics · doi:10.1007/978-3-7908-2410-0_12 · Cited by 55
Shoemaker, C. A., Regis, R. G., & Fleming, R. C. (2007) · Hydrological Sciences Journal · doi:10.1623/hysj.52.3.450 · Cited by 50
Sequential Bayes-Optimal Policies for Multiple Comparisons with a Known Standard
Xie, J., & Frazier, P. I. (2013) · Operations Research · doi:10.1287/opre.2013.1207 · Cited by 47
Self-citationOne-Dimensional global optimization for observations with noise
Calvin, J. M., & silinskas, A. (2005) · Computers & Mathematics with Applications · doi:10.1016/j.camwa.2004.12.014 · Cited by 33
Average performance of a class of adaptive algorithms for global optimization
Calvin, J. M. (1997) · The Annals of Applied Probability · doi:10.1214/aoap/1034801250 · Cited by 26
Xie, J., Frazier, P. I., Sankaran, S., Marsden, A. L., & Elmohamed, S. (2012) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2012.6483247 · Cited by 17
Self-citation
Cited by
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
Two-step machine learning enables optimized nanoparticle synthesis
Mekki-Berrada, F., Ren, Z., Huang, T., Wong, W. K., Zheng, F., Xie, J., Tian, I. P. S., Jayavelu, S., Mahfoud, Z., Bash, D., et al. (2021) · npj Computational Materials · doi:10.1038/s41524-021-00520-w · Cited by 267
Training of quantum circuits on a hybrid quantum computer
Zhu, D., Linke, N. M., Benedetti, M., Landsman, K. A., Nguyen, N. H., Alderete, C. H., Perdomo-Ortiz, A., Korda, N., Garfoot, A., Brecque, C., et al. (2019) · Science Advances · doi:10.1126/sciadv.aaw9918 · Cited by 215
Wang, Q., Qin, Y., Xie, J., Kong, Y., Sun, Q., Wei, Z., & Zhao, S. (2025) · Advanced Materials · doi:10.1002/adma.202420173 · Cited by 61
Accessory pathway analysis using a multimodal deep learning model
Nishimori, M., Kiuchi, K., Nishimura, K., Kusano, K., Yoshida, A., Adachi, K., Hirayama, Y., Miyazaki, Y., Fujiwara, R., Sommer, P., et al. (2021) · Scientific Reports · doi:10.1038/s41598-021-87631-y · Cited by 36
Metadata
- Authors
- Frazier, P. I.
- Venue
- Recent Advances in Optimization and Modeling of Contemporary Problems
- Publisher
- INFORMS
- Published
- 2018-10
- Pages
- 255-278
- OpenAlex
- W4238746485
- Cited by
- 826
- References
- 60
- FWCI
- 112.89
- Type
- book chapter
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.