Preprint · 2018 · Open access
Efficient and Scalable Batch Bayesian Optimization Using K-Means
arXiv (Cornell University) · Published 4 June 2018 · DOI 10.48550/arxiv.1806.01159
In brief
“Efficient and Scalable Batch Bayesian Optimization Using K-Means” is a 2018 preprint by Matthew Groves and Edward O. Pyzer‐Knapp, published in arXiv (Cornell University). OpenAlex counts 23 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 23
- Most cited in
- 2020 (7)
- References
- 16
- Authors
- 2
Abstract
We present K-Means Batch Bayesian Optimization (KMBBO), a novel batch sampling algorithm for Bayesian Optimization (BO). KMBBO uses unsupervised learning to efficiently estimate peaks of the model acquisition function. We show in empirical experiments that our method outperforms the current state-of-the-art batch allocation algorithms on a variety of test problems including tuning of algorithm hyper-parameters and a challenging drug discovery problem. In order to accommodate the real-world problem of high dimensional data, we propose a modification to KMBBO by combining it with compressed sensing to project the optimization into a lower dimensional subspace. We demonstrate empirically that this 2-step method outperforms algorithms where no dimensionality reduction has taken place.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Groves, M., & Pyzer‐Knapp, E. O. (2018). Efficient and Scalable Batch Bayesian Optimization Using K-Means. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1806.01159
MLA 9
Groves, Matthew, and Edward O. Pyzer‐Knapp. “Efficient and Scalable Batch Bayesian Optimization Using K-Means.” arXiv (Cornell University), 2018. https://doi.org/10.48550/arxiv.1806.01159.
Chicago
Groves, Matthew and Edward O. Pyzer‐Knapp. 2018. “Efficient and Scalable Batch Bayesian Optimization Using K-Means.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1806.01159.
Harvard
Groves, M. and Pyzer‐Knapp, E. O. (2018) ‘Efficient and Scalable Batch Bayesian Optimization Using K-Means’, arXiv (Cornell University). doi:10.48550/arxiv.1806.01159.
IEEE
M. Groves and E. O. Pyzer‐Knapp, “Efficient and Scalable Batch Bayesian Optimization Using K-Means,” arXiv (Cornell University), 2018, doi: 10.48550/arxiv.1806.01159.
BibTeX
@misc{groves2018efficient,
title = {{Efficient and Scalable Batch Bayesian Optimization Using K-Means}},
author = {Groves, Matthew and Pyzer‐Knapp, Edward O.},
howpublished = {arXiv (Cornell University)},
year = {2018},
doi = {10.48550/arxiv.1806.01159},
url = {https://doi.org/10.48550/arxiv.1806.01159}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2019 | 1 | |
| 2020 | 7 | |
| 2021 | 5 | |
| 2022 | 3 | |
| 2023 | 2 | |
| 2024 | 3 | |
| 2025 | 2 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- batch Bayesian optimization
- acquisition functions
- unsupervised learning
- hyperparameter optimization
- drug discovery
- compressed sensing
- dimensionality reduction
- high-dimensional optimization
Work with this paper
Most-cited papers in Decision Sciences
- The PRISMA 2020 statement: an updated guideline for reporting systematic reviewsMatthew James Page, Joanne E. McKenzie, Patrick M. Bossuyt and 23 more · BMJ · 2021 · 144,919 citations
- Evaluating Structural Equation Models with Unobservable Variables and Measurement ErrorClaes Fornell, David F. Larcker · Journal of Marketing Research · 1981 · 118,336 citations
- Cutoff criteria for fit indexes in covariance structure analysis: Conventional criteria versus new alternativesLi‐tze Hu, Peter M. Bentler · Structural Equation Modeling A Multidisciplinary Journal · 1999 · 117,461 citations
- Common method biases in behavioral research: A critical review of the literature and recommended remedies.Philip M. Podsakoff, SCOTT B. MACKENZIE, Jeong Yeon Lee and 1 more · Journal of Applied Psychology · 2003 · 89,248 citations
- Preferred reporting items for systematic reviews and meta-analyses: the PRISMA statementDavid Moher, Alessandro Liberati, Jennifer Tetzlaff and 2 more · BMJ · 2009 · 85,524 citations
Questions about this paper
How do I cite this paper in APA style?
Groves, M., & Pyzer‐Knapp, E. O. (2018). Efficient and Scalable Batch Bayesian Optimization Using K-Means. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1806.01159
How many times has this paper been cited?
23 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?
Matthew Groves, Edward O. Pyzer‐Knapp.
What is the DOI of this paper?
10.48550/arxiv.1806.01159, permanently at https://doi.org/10.48550/arxiv.1806.01159. 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.