Dissertation · 2017 · Open access

Knowledge Gradient Methods for Bayesian Optimization

Wu, Jian

eCommons (Cornell University) · Published 1 January 2017 · DOI 10.7298/x4610xhc

Open full textView at the publisherCite this paper

In brief

“Knowledge Gradient Methods for Bayesian Optimization” is a 2017 dissertation by Wu, Jian, published in eCommons (Cornell University). OpenAlex counts 9 citations as of 19 November 2026. It is open access under a CC BY-SA licence: the full text is free to read at eCommons (Cornell University).

Citations
9
Most cited in
2019 (2)
References
80
Authors
1

Abstract

Bayesian optimization, a framework for global optimization of expensive-to-evaluate functions, has shown success in machine learning and experimental design because it is able to find global optima with a remarkably small number of potentially noisy objective function evaluations. In this dissertation, we study in detail how the concept of the knowledge gradient (KG) can be adopted to design novel Bayesian optimization algorithms. First, we propose a novel parallel Bayesian optimization algorithm by generalizing the concept of KG from the fully sequential setting to the parallel setting (qKG). By construction, this method provides a one-step Bayes-optimal batch of points to sample. We provide an efficient strategy for computing this Bayes-optimal batch of points, and we demonstrate that the parallel knowledge gradient method finds global optima significantly faster than previous batch Bayesian optimization algorithms on both synthetic test functions and when tuning hyperparameters of practical machine learning algorithms, especially when function evaluations are noisy. Second, we present a novel discretization-free strategy to calculate the set of points to be evaluated under the knowledge gradient method when used over a continuous domain. KG methods are widely studied for discrete ranking and selection problems, and provide a one-step Bayes-optimal point to sample, but all the previous efforts generalizing KG to continuous domains rely on a discretized finite approximation due to the computational challenges in calculating KG. However, the discretization introduces error and scales poorly as the dimension of the domain grows. In this chapter, we develop a fast discretization-free knowledge gradient method for Bayesian optimization, which is useful for all settings where KG is used over a continuous domain that overcomes these challenges. Third, we explore the “what, when, and why” of Bayesian optimization with derivative information. We also develop a Bayesian optimization algorithm that effectively leverages gradients. This algorithm accommodates incomplete and noisy gradient observations, can be used in both the sequential and batch settings, and can optionally reduce the computational overhead of inference by selecting the single most valuable directional derivative to retain. For this purpose, we develop a novel acquisition function, called the derivative-enabled knowledge-gradient (dKG). This generalizes the previously proposed batch knowledge gradient method to the derivative setting. We also provide a theoretical analysis of the algorithm: it is one- step Bayes-optimal by construction when derivatives are available, and we show (1) that it provides one-step value greater than in the derivative-free setting; and (2) that its estimator of the global optimum is asymptotically consistent. Fourth, we show some preliminary results on how KG can be adopted to settings where…

Cite this paper

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

APA 7

Jian, W. (2017). Knowledge Gradient Methods for Bayesian Optimization. eCommons (Cornell University). https://doi.org/10.7298/x4610xhc

MLA 9

Jian, Wu,. “Knowledge Gradient Methods for Bayesian Optimization.” eCommons (Cornell University), 2017. https://doi.org/10.7298/x4610xhc.

Chicago

Jian, Wu,. 2017. “Knowledge Gradient Methods for Bayesian Optimization.” eCommons (Cornell University). https://doi.org/10.7298/x4610xhc.

Harvard

Jian, W. (2017) ‘Knowledge Gradient Methods for Bayesian Optimization’, eCommons (Cornell University). doi:10.7298/x4610xhc.

IEEE

W. Jian, “Knowledge Gradient Methods for Bayesian Optimization,” eCommons (Cornell University), 2017, doi: 10.7298/x4610xhc.

BibTeX

@phdthesis{jian2017knowledge,
  title     = {{Knowledge Gradient Methods for Bayesian Optimization}},
  author    = {Jian, Wu,},
  year      = {2017},
  doi       = {10.7298/x4610xhc},
  url       = {https://doi.org/10.7298/x4610xhc}
}

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

Citations by year

YearCitationsShare of the best year
201922
202022
202111
202211
202511
202622

Topic and keywords

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

  • knowledge gradient
  • Bayesian optimization
  • batch Bayesian optimization
  • derivative information
  • noisy gradients
  • acquisition functions
  • hyperparameter optimization
  • global 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?

Jian, W. (2017). Knowledge Gradient Methods for Bayesian Optimization. eCommons (Cornell University). https://doi.org/10.7298/x4610xhc

How many times has this paper been cited?

9 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 eCommons (Cornell University): sign in and open the full text from this page.

Who wrote this paper?

Wu, Jian.

What is the DOI of this paper?

10.7298/x4610xhc, permanently at https://doi.org/10.7298/x4610xhc. 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.