Preprint · 2017 · Open access

Max-value Entropy Search for Efficient Bayesian Optimization

Zi Wang, Stefanie Jegelka

arXiv (Cornell University) · Published 6 March 2017 · DOI 10.48550/arxiv.1703.01968

Open PDFView at the publisherCite this paper

In brief

“Max-value Entropy Search for Efficient Bayesian Optimization” is a 2017 preprint by Zi Wang and Stefanie Jegelka, published in arXiv (Cornell University). OpenAlex counts 292 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
292
Most cited in
2021 (61)
References
26
Authors
2

Abstract

Entropy Search (ES) and Predictive Entropy Search (PES) are popular and empirically successful Bayesian Optimization techniques. Both rely on a compelling information-theoretic motivation, and maximize the information gained about the $\arg\max$ of the unknown function; yet, both are plagued by the expensive computation for estimating entropies. We propose a new criterion, Max-value Entropy Search (MES), that instead uses the information about the maximum function value. We show relations of MES to other Bayesian optimization methods, and establish a regret bound. We observe that MES maintains or improves the good empirical performance of ES/PES, while tremendously lightening the computational burden. In particular, MES is much more robust to the number of samples used for computing the entropy, and hence more efficient for higher dimensional problems.

Cite this paper

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

APA 7

Wang, Z., & Jegelka, S. (2017). Max-value Entropy Search for Efficient Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1703.01968

MLA 9

Wang, Zi, and Stefanie Jegelka. “Max-value Entropy Search for Efficient Bayesian Optimization.” arXiv (Cornell University), 2017. https://doi.org/10.48550/arxiv.1703.01968.

Chicago

Wang, Zi and Stefanie Jegelka. 2017. “Max-value Entropy Search for Efficient Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1703.01968.

Harvard

Wang, Z. and Jegelka, S. (2017) ‘Max-value Entropy Search for Efficient Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.1703.01968.

IEEE

Z. Wang and S. Jegelka, “Max-value Entropy Search for Efficient Bayesian Optimization,” arXiv (Cornell University), 2017, doi: 10.48550/arxiv.1703.01968.

BibTeX

@misc{wang2017value,
  title     = {{Max-value Entropy Search for Efficient Bayesian Optimization}},
  author    = {Wang, Zi and Jegelka, Stefanie},
  howpublished = {arXiv (Cornell University)},
  year      = {2017},
  doi       = {10.48550/arxiv.1703.01968},
  url       = {https://doi.org/10.48550/arxiv.1703.01968}
}

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

Citations by year

YearCitationsShare of the best year
201722
201899
20193232
20205151
20216161
20222929
20232727
20242828
20253131
20262222

Topic and keywords

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

  • Bayesian optimization
  • entropy estimation
  • regret bounds
  • high-dimensional 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?

Wang, Z., & Jegelka, S. (2017). Max-value Entropy Search for Efficient Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1703.01968

How many times has this paper been cited?

292 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?

Zi Wang, Stefanie Jegelka.

What is the DOI of this paper?

10.48550/arxiv.1703.01968, permanently at https://doi.org/10.48550/arxiv.1703.01968. 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.