Preprint · 2015 · Open access
Batch Bayesian Optimization via Local Penalization
arXiv (Cornell University), 648–657 · Published 29 May 2015 · DOI 10.48550/arxiv.1505.08052
In brief
“Batch Bayesian Optimization via Local Penalization” is a 2015 preprint by Javier González and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 482 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).
- Citations
- 482
- Most cited in
- 2026 (69)
- References
- 22
- Authors
- 4
Abstract
The popularity of Bayesian optimization methods for efficient exploration of parameter spaces has lead to a series of papers applying Gaussian processes as surrogates in the optimization of functions. However, most proposed approaches only allow the exploration of the parameter space to occur sequentially. Often, it is desirable to simultaneously propose batches of parameter values to explore. This is particularly the case when large parallel processing facilities are available. These facilities could be computational or physical facets of the process being optimized. E.g. in biological experiments many experimental set ups allow several samples to be simultaneously processed. Batch methods, however, require modeling of the interaction between the evaluations in the batch, which can be expensive in complex scenarios. We investigate a simple heuristic based on an estimate of the Lipschitz constant that captures the most important aspect of this interaction (i.e. local repulsion) at negligible computational overhead. The resulting algorithm compares well, in running time, with much more elaborate alternatives. The approach assumes that the function of interest, $f$, is a Lipschitz continuous function. A wrap-loop around the acquisition function is used to collect batches of points of certain size minimizing the non-parallelizable computational effort. The speed-up of our method with respect to previous approaches is significant in a set of computationally expensive experiments.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
González, J., Zhenwen, D., Hennig, P., & Lawrence, N. D. (2015). Batch Bayesian Optimization via Local Penalization. arXiv (Cornell University), 648–657. https://doi.org/10.48550/arxiv.1505.08052
MLA 9
González, Javier, et al. “Batch Bayesian Optimization via Local Penalization.” arXiv (Cornell University), 2015, pp. 648–657. https://doi.org/10.48550/arxiv.1505.08052.
Chicago
González, Javier, Dai, Zhenwen, Philipp Hennig, and Neil David Lawrence. 2015. “Batch Bayesian Optimization via Local Penalization.” arXiv (Cornell University): 648–657. https://doi.org/10.48550/arxiv.1505.08052.
Harvard
González, J. et al. (2015) ‘Batch Bayesian Optimization via Local Penalization’, arXiv (Cornell University), pp. 648–657. doi:10.48550/arxiv.1505.08052.
IEEE
J. González, D. Zhenwen, P. Hennig, and N. D. Lawrence, “Batch Bayesian Optimization via Local Penalization,” arXiv (Cornell University), pp. 648–657, 2015, doi: 10.48550/arxiv.1505.08052.
BibTeX
@misc{gonzalez2015batch,
title = {{Batch Bayesian Optimization via Local Penalization}},
author = {González, Javier and Zhenwen, Dai, and Hennig, Philipp and Lawrence, Neil David},
howpublished = {arXiv (Cornell University)},
year = {2015},
pages = {648--657},
doi = {10.48550/arxiv.1505.08052},
url = {https://doi.org/10.48550/arxiv.1505.08052}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2017 | 25 | |
| 2018 | 23 | |
| 2019 | 51 | |
| 2020 | 53 | |
| 2021 | 49 | |
| 2022 | 50 | |
| 2023 | 47 | |
| 2024 | 39 | |
| 2025 | 68 | |
| 2026 | 69 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- batch Bayesian optimization
- Lipschitz constant estimation
- Kriging surrogate model
- acquisition functions
- parallel evaluation
- expensive function evaluations
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?
González, J., Zhenwen, D., Hennig, P., & Lawrence, N. D. (2015). Batch Bayesian Optimization via Local Penalization. arXiv (Cornell University), 648–657. https://doi.org/10.48550/arxiv.1505.08052
How many times has this paper been cited?
482 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?
Javier González, Dai, Zhenwen, Philipp Hennig, Neil David Lawrence.
What is the DOI of this paper?
10.48550/arxiv.1505.08052, permanently at https://doi.org/10.48550/arxiv.1505.08052. 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.