The DOI matches its Crossref record.
On bayesian methods for seeking the extremum
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Cited by
A tutorial on Gaussian process regression: modelling, exploring, and exploiting functions
Schulz, E., Speekenbrink, M., & Krause, A. (2018) · Journal of Mathematical Psychology · doi:10.1016/j.jmp.2018.03.001 · Cited by 1,735
Evolving Deep Convolutional Neural Networks for Image Classification
Sun, Y., Xue, B., Zhang, M., & Yen, G. G. (2020) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2019.2916183 · Cited by 775
Self-Driving Laboratories for Chemistry and Materials Science
Tom, G., Schmid, S. P., Baird, S. G., Cao, Y., Darvish, K., Hao, H., Lo, S., Pablo-García, S., Rajaonson, E. M., Skreta, M., et al. (2024) · Chemical Reviews · doi:10.1021/acs.chemrev.4c00055 · Cited by 707
Efficient Deep Learning: A Survey on Making Deep Learning Models Smaller, Faster, and Better
Menghani, G. (2023) · ACM Computing Surveys · doi:10.1145/3578938 · Cited by 605
Convergence rates of efficient global optimization algorithms
Bull, A. D. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1101.3501 · Cited by 446
Hyper-Parameter Optimization: A Review of Algorithms and Applications
Yu, T., & Zhu, H. C. (2020) · arXiv (Cornell University) · doi:10.48550/arxiv.2003.05689 · Cited by 437
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
Phoenics: A Bayesian Optimizer for Chemistry
Häse, F., Roch, L. M., Kreisbeck, C., & Aspuru-Guzik, A. (2018) · ACS Central Science · doi:10.1021/acscentsci.8b00307 · Cited by 379
Quantum-assisted quantum compiling
Khatri, S., LaRose, R., Poremba, A., Cincio, L., Sornborger, A. T., & Coles, P. J. (2019) · Quantum · doi:10.22331/q-2019-05-13-140 · Cited by 382
A Tutorial on Bayesian Optimization
Frazier, P. I. (2018) · arXiv (Cornell University) · doi:10.48550/arxiv.1807.02811 · Cited by 342
Surrogate modelling for sustainable building design – A review
Westermann, P., & Evins, R. (2019) · Energy and Buildings · doi:10.1016/j.enbuild.2019.05.057 · Cited by 340
Completely Automated CNN Architecture Design Based on Blocks
Sun, Y., Xue, B., Zhang, M., & Yen, G. G. (2020) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2019.2919608 · Cited by 338
Garrido-Merchán, E. C., & Hernández-Lobato, D. (2020) · Neurocomputing · doi:10.1016/j.neucom.2019.11.004 · Cited by 291
The Bayesian approach to global optimization
Mockus, J. (2005) · Lecture Notes in Control and Information Sciences · doi:10.1007/bfb0006170 · Cited by 283
Bradford, E., Schweidtmann, A. M., & Lapkin, A. (2018) · Journal of Global Optimization · doi:10.1007/s10898-018-0609-2 · Cited by 266
BANANAS: Bayesian Optimization with Neural Architectures for Neural Architecture Search
White, C., Neiswanger, W., & Savani, Y. (2021) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v35i12.17233 · Cited by 261
Effect of barren plateaus on gradient-free optimization
Arrasmith, A., Cerezo, M., Czarnik, P., Cincio, L., & Coles, P. J. (2021) · Quantum · doi:10.22331/q-2021-10-05-558 · Cited by 248
PipeDream: Fast and Efficient Pipeline Parallel DNN Training
Harlap, A., Narayanan, D., Phanishayee, A., Seshadri, V., Devanur, N., Ganger, G., & Gibbons, P. (2018) · arXiv · doi:10.48550/arxiv.1806.03377 · Cited by 153
“Guided by prior work, we adjust the learning rate during training to converge to the desired result faster [31, 37, 38, 13, 24].”
MethodBayesian optimization with known experimental and design constraints for chemistry applications
Hickman, R. J., Aldeghi, M., Häse, F., & Aspuru-Guzik, A. (2022) · Digital Discovery · doi:10.1039/d2dd00028h · Cited by 98
Painting Peptides With Antimicrobial Potency Through Deep Reinforcement Learning
Dong, R., Cao, Q., & Song, C. (2025) · Advanced Science · doi:10.1002/advs.202506332 · Cited by 11
(2021) · arXiv (Cornell University) · Cited by 11
Automatic Discovery of Privacy–Utility Pareto Fronts
Avent, B., González, J., Diethe, T., Paleyes, A., & Balle, B. (2020) · Proceedings on Privacy Enhancing Technologies · doi:10.2478/popets-2020-0060 · Cited by 3
Metadata
- Authors
- Močkus, J.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 1975
- Pages
- 400-404
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1529817821
- Cited by
- 499
- References
- 0
- FWCI
- 1.24
- Type
- conference paper
- 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.