Preprint · 2021 · Open access

Efficient Exploration in Binary and Preferential Bayesian Optimization

Tristan Fauvel, Matthew Chalk

arXiv (Cornell University) · Published 18 October 2021 · DOI 10.48550/arxiv.2110.09361

Open PDFView at the publisherCite this paper

In brief

“Efficient Exploration in Binary and Preferential Bayesian Optimization” is a 2021 preprint by Tristan Fauvel and Matthew Chalk, published in arXiv (Cornell University). OpenAlex counts 13 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).

Citations
13
Most cited in
2023 (4)
References
37
Authors
2

Abstract

Bayesian optimization (BO) is an effective approach to optimize expensive black-box functions, that seeks to trade-off between exploitation (selecting parameters where the maximum is likely) and exploration (selecting parameters where we are uncertain about the objective function). In many real-world situations, direct measurements of the objective function are not possible, and only binary measurements such as success/failure or pairwise comparisons are available. To perform efficient exploration in this setting, we show that it is important for BO algorithms to distinguish between different types of uncertainty: epistemic uncertainty, about the unknown objective function, and aleatoric uncertainty, which comes from noisy observations and cannot be reduced. In effect, only the former is important for efficient exploration. Based on this, we propose several new acquisition functions that outperform state-of-the-art heuristics in binary and preferential BO, while being fast to compute and easy to implement. We then generalize these acquisition rules to batch learning, where multiple queries are performed simultaneously.

Cite this paper

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

APA 7

Fauvel, T., & Chalk, M. (2021). Efficient Exploration in Binary and Preferential Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2110.09361

MLA 9

Fauvel, Tristan, and Matthew Chalk. “Efficient Exploration in Binary and Preferential Bayesian Optimization.” arXiv (Cornell University), 2021. https://doi.org/10.48550/arxiv.2110.09361.

Chicago

Fauvel, Tristan and Matthew Chalk. 2021. “Efficient Exploration in Binary and Preferential Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2110.09361.

Harvard

Fauvel, T. and Chalk, M. (2021) ‘Efficient Exploration in Binary and Preferential Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2110.09361.

IEEE

T. Fauvel and M. Chalk, “Efficient Exploration in Binary and Preferential Bayesian Optimization,” arXiv (Cornell University), 2021, doi: 10.48550/arxiv.2110.09361.

BibTeX

@misc{fauvel2021efficient,
  title     = {{Efficient Exploration in Binary and Preferential Bayesian Optimization}},
  author    = {Fauvel, Tristan and Chalk, Matthew},
  howpublished = {arXiv (Cornell University)},
  year      = {2021},
  doi       = {10.48550/arxiv.2110.09361},
  url       = {https://doi.org/10.48550/arxiv.2110.09361}
}

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

Citations by year

YearCitationsShare of the best year
202111
202211
202344
202444
202522
202611

Topic and keywords

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

  • Bayesian optimization
  • binary optimization
  • exploration-exploitation balance
  • epistemic uncertainty
  • aleatoric uncertainty
  • acquisition functions
  • pairwise comparison
  • noisy measurements

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?

Fauvel, T., & Chalk, M. (2021). Efficient Exploration in Binary and Preferential Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2110.09361

How many times has this paper been cited?

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

Tristan Fauvel, Matthew Chalk.

What is the DOI of this paper?

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