Dissertation · 2015 · Open access

Constrained Bayesian Optimization and Applications

Michael A. Gelbart

Digital Access to Scholarship at Harvard (DASH) (Harvard University) · Published 17 May 2015

Open full textCite this paper

In brief

“Constrained Bayesian Optimization and Applications” is a 2015 dissertation by Michael A. Gelbart, published in Digital Access to Scholarship at Harvard (DASH) (Harvard University). OpenAlex counts 55 citations as of 19 November 2026. It is open access: the full text is free to read at Digital Access to Scholarship at Harvard (DASH) (Harvard University).

Citations
55
Most cited in
2021 (9)
References
94
Authors
1

Abstract

Bayesian optimization is an approach for globally optimizing black-box functions that are expensive to evaluate, non-convex, and possibly noisy. Recently, Bayesian optimization has been used with great effectiveness for applications like tuning the hyperparameters of machine learning algorithms and automatic A/B testing for websites. This thesis considers Bayesian optimization in the presence of black-box constraints. Prior work on constrained Bayesian optimization consists of a variety of methods that can be used with some efficacy in specific contexts. Here, by forming a connection with multi-task Bayesian optimization, we formulate a more general class of constrained Bayesian optimization problems that we call Bayesian optimization with decoupled constraints. In this general framework, the objective and constraint functions are divided into tasks that can be evaluated independently of each other, and resources with which these tasks can be performed. We then present two methods for solving problems in this general class. The first method, an extension to a constrained variant of expected improvement, is fast and straightforward to implement but performs poorly in some circumstances and is not sufficiently flexible to address all varieties of decoupled problems. The second method, Predictive Entropy Search with Constraints (PESC), is highly effective and sufficiently flexible to address all problems in the general class of decoupled problems without any ad hoc modifications. The two weaknesses of PESC are its implementation difficulty and slow execution time. We address these issues by, respectively, providing a publicly available implementation within the popular Bayesian optimization software Spearmint, and developing an extension to PESC that achieves greater speed without significant performance losses. We demonstrate the effectiveness of these methods on real-world machine learning meta-optimization problems.

Cite this paper

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

APA 7

Gelbart, M. A. (2015). Constrained Bayesian Optimization and Applications. Digital Access to Scholarship at Harvard (DASH) (Harvard University). http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467236

MLA 9

Gelbart, Michael A. “Constrained Bayesian Optimization and Applications.” Digital Access to Scholarship at Harvard (DASH) (Harvard University), 2015. http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467236.

Chicago

Gelbart, Michael A. 2015. “Constrained Bayesian Optimization and Applications.” Digital Access to Scholarship at Harvard (DASH) (Harvard University). http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467236.

Harvard

Gelbart, M. A. (2015) ‘Constrained Bayesian Optimization and Applications’, Digital Access to Scholarship at Harvard (DASH) (Harvard University). Available at: http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467236.

IEEE

M. A. Gelbart, “Constrained Bayesian Optimization and Applications,” Digital Access to Scholarship at Harvard (DASH) (Harvard University), 2015.

BibTeX

@phdthesis{gelbart2015constrained,
  title     = {{Constrained Bayesian Optimization and Applications}},
  author    = {Gelbart, Michael A.},
  year      = {2015},
  url       = {http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467236}
}

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

Citations by year

YearCitationsShare of the best year
201744
201833
201944
202066
202199
202266
202388
202444
202566
202622

Topic and keywords

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

  • constrained Bayesian optimization
  • expected improvement
  • black-box optimization
  • expensive function evaluations
  • Mentha spicata
  • hyperparameter optimization

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?

Gelbart, M. A. (2015). Constrained Bayesian Optimization and Applications. Digital Access to Scholarship at Harvard (DASH) (Harvard University). http://nrs.harvard.edu/urn-3:HUL.InstRepos:17467236

How many times has this paper been cited?

55 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 Digital Access to Scholarship at Harvard (DASH) (Harvard University): sign in and open the full text from this page.

Who wrote this paper?

Michael A. Gelbart.

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.