Preprint · 2021 · Open access
Two-step Lookahead Bayesian Optimization with Inequality Constraints
arXiv (Cornell University) · Published 6 December 2021 · DOI 10.48550/arxiv.2112.02833
In brief
“Two-step Lookahead Bayesian Optimization with Inequality Constraints” is a 2021 preprint by Yunxiang Zhang and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 4 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 4
- Most cited in
- 2023 (2)
- References
- 34
- Authors
- 3
Abstract
Recent advances in computationally efficient non-myopic Bayesian optimization (BO) improve query efficiency over traditional myopic methods like expected improvement while only modestly increasing computational cost. These advances have been largely limited, however, to unconstrained optimization. For constrained optimization, the few existing non-myopic BO methods require heavy computation. For instance, one existing non-myopic constrained BO method [Lam and Willcox, 2017] relies on computationally expensive unreliable brute-force derivative-free optimization of a Monte Carlo rollout acquisition function. Methods that use the reparameterization trick for more efficient derivative-based optimization of non-myopic acquisition functions in the unconstrained setting, like sample average approximation and infinitesimal perturbation analysis, do not extend: constraints introduce discontinuities in the sampled acquisition function surface that hinder its optimization. Moreover, we argue here that being non-myopic is even more important in constrained problems because fear of violating constraints pushes myopic methods away from sampling the boundary between feasible and infeasible regions, slowing the discovery of optimal solutions with tight constraints. In this paper, we propose a computationally efficient two-step lookahead constrained Bayesian optimization acquisition function (2-OPT-C) supporting both sequential and batch settings. To enable fast acquisition function optimization, we develop a novel likelihood-ratio-based unbiased estimator of the gradient of the two-step optimal acquisition function that does not use the reparameterization trick. In numerical experiments, 2-OPT-C typically improves query efficiency by 2x or more over previous methods, and in some cases by 10x or more.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Zhang, Y., Zhang, X., & Frazier, P. I. (2021). Two-step Lookahead Bayesian Optimization with Inequality Constraints. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2112.02833
MLA 9
Zhang, Yunxiang, et al. “Two-step Lookahead Bayesian Optimization with Inequality Constraints.” arXiv (Cornell University), 2021. https://doi.org/10.48550/arxiv.2112.02833.
Chicago
Zhang, Yunxiang, Xiangyu Zhang, and Peter I. Frazier. 2021. “Two-step Lookahead Bayesian Optimization with Inequality Constraints.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2112.02833.
Harvard
Zhang, Y., Zhang, X. and Frazier, P. I. (2021) ‘Two-step Lookahead Bayesian Optimization with Inequality Constraints’, arXiv (Cornell University). doi:10.48550/arxiv.2112.02833.
IEEE
Y. Zhang, X. Zhang, and P. I. Frazier, “Two-step Lookahead Bayesian Optimization with Inequality Constraints,” arXiv (Cornell University), 2021, doi: 10.48550/arxiv.2112.02833.
BibTeX
@misc{zhang2021step,
title = {{Two-step Lookahead Bayesian Optimization with Inequality Constraints}},
author = {Zhang, Yunxiang and Zhang, Xiangyu and Frazier, Peter I.},
howpublished = {arXiv (Cornell University)},
year = {2021},
doi = {10.48550/arxiv.2112.02833},
url = {https://doi.org/10.48550/arxiv.2112.02833}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Bayesian optimization
- inequality constraints
- batch Bayesian optimization
- expected improvement
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Zhang, Y., Zhang, X., & Frazier, P. I. (2021). Two-step Lookahead Bayesian Optimization with Inequality Constraints. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2112.02833
How many times has this paper been cited?
4 times, according to OpenAlex on 19 November 2026. Google Scholar and Scopus count different sets of sources, so their numbers differ.
Is this paper free to read?
Yes. It is open access at arXiv (Cornell University): sign in and open the PDF from this page.
Who wrote this paper?
Yunxiang Zhang, Xiangyu Zhang, Peter I. Frazier.
What is the DOI of this paper?
10.48550/arxiv.2112.02833, permanently at https://doi.org/10.48550/arxiv.2112.02833. Sign in and open it from this page.
Bibliographic data from OpenAlex (CC0), last checked 19 November 2026. ResearchGuru does not host this paper; once you are signed in, the links open it at the publisher or the repository that does.