The DOI matches its Crossref record; 48 of the 48 references it cites were found in a registry or an index.
Constrained Bayesian Optimization with Noisy Experiments
Open accessAbstract
Randomized experiments are the gold standard for evaluating the effects of changes to real-world systems. Data in these tests may be difficult to collect and outcomes may have high variance, resulting in potentially large measurement error. Bayesian optimization is a promising technique for efficiently optimizing multiple continuous parameters, but existing approaches degrade in performance when the noise level is high, limiting its applicability to many randomized experiments. We derive an expression for expected improvement under greedy batch optimization with noisy observations and noisy constraints, and develop a quasi-Monte Carlo approximation that allows it to be efficiently optimized. Simulations with synthetic functions show that optimization performance on noisy, constrained problems outperforms existing methods. We further demonstrate the effectiveness of the method with two real-world experiments conducted at Facebook: optimizing a ranking system, and optimizing server compiler flags.
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
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
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
Deep Neural Networks for YouTube Recommendations
Covington, P., Adams, J., & Sargin, E. (2016) · Proceedings of the 10th ACM Conference on Recommender Systems · doi:10.1145/2959100.2959190 · Cited by 3,539
The No-U-turn sampler: adaptively setting path lengths in Hamiltonian Monte CarloPreprint
Homan, M. D., & Gelman, A. (2014) · arXiv (Cornell University) · Cited by 3,077
THOMPSON, W. R. (1933) · Biometrika · doi:10.1093/biomet/25.3-4.285 · Cited by 2,712
Monte Carlo and quasi-Monte Carlo methods
Caflisch, R. E. (1998) · Acta Numerica · doi:10.1017/s0962492900002804 · Cited by 1,754
The No-U-Turn Sampler: Adaptively Setting Path Lengths in Hamiltonian Monte Carlo
Hoffman, M. D., & Gelman, A. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1111.4246 · Cited by 1,713
Estimating Individualized Treatment Rules Using Outcome Weighted Learning
Zhao, Y., Zeng, D., Rush, A. J., & Kosorok, M. R. (2012) · Journal of the American Statistical Association · doi:10.1080/01621459.2012.695674 · Cited by 739
Global Optimization of Stochastic Black-Box Systems via Sequential Kriging Meta-Models
Huang, D., Allen, T. T., Notz, W. I., & Zeng, N. (2006) · Journal of Global Optimization · doi:10.1007/s10898-005-2454-3 · Cited by 625
High-dimensional integration: The quasi-Monte Carlo way
Dick, J., Kuo, F. Y., & Sloan, I. H. (2013) · Acta Numerica · doi:10.1017/s0962492913000044 · Cited by 615
Cited by
Lookman, T., Balachandran, P. V., Xue, D., & Yuan, R. (2019) · npj Computational Materials · doi:10.1038/s41524-019-0153-8 · Cited by 832
Prescriptive analytics: Literature review and research challenges
Lepenioti, K., Bousdekis, A., Apostolou, D., & Mentzas, G. (2020) · International Journal of Information Management · doi:10.1016/j.ijinfomgt.2019.04.003 · Cited by 501
“Typically, this process begins by evaluating a small number of randomly selected function values, and fitting a Gaussian process regression model to the results (Letham, Karrer, Ottoni, & Bakshy, 2019).”
Recent Advances in Bayesian Optimization
Wang, X., Jin, Y., Schmitt, S., & Olhofer, M. (2023) · ACM Computing Surveys · doi:10.1145/3582078 · Cited by 477
Application of Improved LightGBM Model in Blood Glucose Prediction
Wang, Y., & Wang, T. (2020) · Applied Sciences · doi:10.3390/app10093227 · Cited by 129
Algorithmic transparency and assessing effects of algorithmic ranking
Eckles, D. (2022) · doi:10.31235/osf.io/c8za6 · Cited by 12
Metadata
- Authors
- Letham, B., Karrer, B., Ottoni, G., & Bakshy, E.
- Venue
- Bayesian Analysis
- Publisher
- Institute of Mathematical Statistics
- Published
- 2019-06-01
- Volume
- 14
- Issue
- 2
- Pages
- 495-519
- ISSN
- 1931-6690 (ISSN-L)
- 1936-0975
- OpenAlex
- W2646476955
- Cited by
- 307
- References
- 48
- FWCI
- 24.19
- Type
- journal article
- Language
- en
- Open access
- diamond
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Constrained Bayesian Optimization with Noisy Experiments. https://app.cochat.ai/papers/10.1214/18-ba1110
- The paper
- Letham, B., Karrer, B., Ottoni, G., & Bakshy, E. (2019). Constrained Bayesian Optimization with Noisy Experiments. Bayesian Analysis. https://doi.org/10.1214/18-ba1110
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.