Journal article · 2023 · Open access

Dependence in constrained Bayesian optimization: When do we need it and how does it help?

Shiqiang Zhang, Robert M. Lee, Behrang Shafei, D. Walz, Ruth Misener

Optimization Letters, 18(6), 1457–1473 · Published 20 September 2023 · DOI 10.1007/s11590-023-02047-z

Open PDFView at the publisherCite this paper

In brief

“Dependence in constrained Bayesian optimization: When do we need it and how does it help?” is a 2023 journal article by Shiqiang Zhang and 4 co-authors, published in Optimization Letters. OpenAlex counts 7 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at Optimization Letters.

Citations
7
Most cited in
2024 (3)
Field-weighted impact
0.86
References
39
Authors
5

Abstract

Constrained Bayesian optimization optimizes a black-box objective function subject to black-box constraints. For simplicity, most existing works assume that multiple constraints are independent. To ask, when and how does dependence between constraints help? , we remove this assumption and implement probability of feasibility with dependence (Dep-PoF) by applying multiple output Gaussian processes (MOGPs) as surrogate models and using expectation propagation to approximate the probabilities. We compare Dep-PoF and the independent version PoF. We propose two new acquisition functions incorporating Dep-PoF and test them on synthetic and practical benchmarks. Our results are largely negative: incorporating dependence between the constraints does not help much. Empirically, incorporating dependence between constraints may be useful if: (i) the solution is on the boundary of the feasible region(s) or (ii) the feasible set is very small. When these conditions are satisfied, the predictive covariance matrix from the MOGP may be poorly approximated by a diagonal matrix and the off-diagonal matrix elements may become important. Dep-PoF may apply to settings where (i) the constraints and their dependence are totally unknown and (ii) experiments are so expensive that any slightly better Bayesian optimization procedure is preferred. But, in most cases, Dep-PoF is indistinguishable from PoF.

Cite this paper

Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.

APA 7

Zhang, S., Lee, R. M., Shafei, B., Walz, D., & Misener, R. (2023). Dependence in constrained Bayesian optimization: When do we need it and how does it help? Optimization Letters, 18(6), 1457–1473. https://doi.org/10.1007/s11590-023-02047-z

MLA 9

Zhang, Shiqiang, et al. “Dependence in constrained Bayesian optimization: When do we need it and how does it help?” Optimization Letters, vol. 18, no. 6, 2023, pp. 1457–1473. https://doi.org/10.1007/s11590-023-02047-z.

Chicago

Zhang, Shiqiang, Robert M. Lee, Behrang Shafei, D. Walz, and Ruth Misener. 2023. “Dependence in constrained Bayesian optimization: When do we need it and how does it help?” Optimization Letters 18 (6): 1457–1473. https://doi.org/10.1007/s11590-023-02047-z.

Harvard

Zhang, S. et al. (2023) ‘Dependence in constrained Bayesian optimization: When do we need it and how does it help?’, Optimization Letters, 18(6), pp. 1457–1473. doi:10.1007/s11590-023-02047-z.

IEEE

S. Zhang, R. M. Lee, B. Shafei, D. Walz, and R. Misener, “Dependence in constrained Bayesian optimization: When do we need it and how does it help?,” Optimization Letters, vol. 18, no. 6, pp. 1457–1473, 2023, doi: 10.1007/s11590-023-02047-z.

BibTeX

@article{zhang2023dependence,
  title     = {{Dependence in constrained Bayesian optimization: When do we need it and how does it help?}},
  author    = {Zhang, Shiqiang and Lee, Robert M. and Shafei, Behrang and Walz, D. and Misener, Ruth},
  journal   = {Optimization Letters},
  year      = {2023},
  volume    = {18},
  number    = {6},
  pages     = {1457--1473},
  doi       = {10.1007/s11590-023-02047-z},
  url       = {https://doi.org/10.1007/s11590-023-02047-z}
}

Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)

Citations by year

YearCitationsShare of the best year
202433
202533
202611

Its field-weighted citation impact is 0.86: it has been cited 0.86 times as often as the average work of the same field, type and year (1.00 is the world average).

Topic and keywords

Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research

  • constrained Bayesian optimization
  • expectation propagation
  • acquisition functions
  • surrogate models

Work with this paper

Most-cited papers in Decision Sciences

All highly cited Decision Sciences papers

Questions about this paper

How do I cite this paper in APA style?

Zhang, S., Lee, R. M., Shafei, B., Walz, D., & Misener, R. (2023). Dependence in constrained Bayesian optimization: When do we need it and how does it help? Optimization Letters, 18(6), 1457–1473. https://doi.org/10.1007/s11590-023-02047-z

How many times has this paper been cited?

7 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 Optimization Letters: sign in and open the PDF from this page.

Who wrote this paper?

Shiqiang Zhang, Robert M. Lee, Behrang Shafei, D. Walz, Ruth Misener.

What is the DOI of this paper?

10.1007/s11590-023-02047-z, permanently at https://doi.org/10.1007/s11590-023-02047-z. 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.