Paper · 2019 · Open access
Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation
Oxford University Research Archive (ORA) (University of Oxford), 253–262 · Published 29 January 2019 · DOI 10.48550/arxiv.1901.10452
In brief
“Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation” is a 2019 paper by Ahsan Alvi and 4 co-authors, published in Oxford University Research Archive (ORA) (University of Oxford). OpenAlex counts 72 citations as of 19 November 2026, which puts it in the top 8% of works published in 2019 by citations. It is open access: the full text is free to read at Oxford University Research Archive (ORA) (University of Oxford).
- Citations
- 72
- Most cited in
- 2020 (15)
- Field-weighted impact
- 13.14
- References
- 29
- Authors
- 5
Abstract
Batch Bayesian optimisation (BO) has been successfully applied to hyperparameter tuning using parallel computing, but it is wasteful of resources: workers that complete jobs ahead of others are left idle. We address this problem by developing an approach, Penalising Locally for Asynchronous Bayesian Optimisation on $k$ workers (PLAyBOOK), for asynchronous parallel BO. We demonstrate empirically the efficacy of PLAyBOOK and its variants on synthetic tasks and a real-world problem. We undertake a comparison between synchronous and asynchronous BO, and show that asynchronous BO often outperforms synchronous batch BO in both wall-clock time and number of function evaluations.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Alvi, A., Ru, B. X., Calliess, J.-P., Roberts, S., & Osborne, M. A. (2019). Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation. Oxford University Research Archive (ORA) (University of Oxford), 253–262. https://doi.org/10.48550/arxiv.1901.10452
MLA 9
Alvi, Ahsan, et al. “Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation.” Oxford University Research Archive (ORA) (University of Oxford), 2019, pp. 253–262. https://doi.org/10.48550/arxiv.1901.10452.
Chicago
Alvi, Ahsan, Bin Xin Ru, Jan-Peter Calliess, Stephen Roberts, and Michael A. Osborne. 2019. “Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation.” Oxford University Research Archive (ORA) (University of Oxford): 253–262. https://doi.org/10.48550/arxiv.1901.10452.
Harvard
Alvi, A. et al. (2019) ‘Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation’, Oxford University Research Archive (ORA) (University of Oxford), pp. 253–262. doi:10.48550/arxiv.1901.10452.
IEEE
A. Alvi, B. X. Ru, J.-P. Calliess, S. Roberts, and M. A. Osborne, “Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation,” Oxford University Research Archive (ORA) (University of Oxford), pp. 253–262, 2019, doi: 10.48550/arxiv.1901.10452.
BibTeX
@article{alvi2019asynchronous,
title = {{Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation}},
author = {Alvi, Ahsan and Ru, Bin Xin and Calliess, Jan-Peter and Roberts, Stephen and Osborne, Michael A.},
journal = {Oxford University Research Archive (ORA) (University of Oxford)},
year = {2019},
pages = {253--262},
doi = {10.48550/arxiv.1901.10452},
url = {https://doi.org/10.48550/arxiv.1901.10452}
}
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 | 2 | |
| 2020 | 15 | |
| 2021 | 8 | |
| 2022 | 12 | |
| 2023 | 10 | |
| 2024 | 6 | |
| 2025 | 4 | |
| 2026 | 15 |
Its field-weighted citation impact is 13.14: it has been cited 13.14 times as often as the average work of the same field, type and year (1.00 is the world average).
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- hyperparameter optimization
- playbooks
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?
Alvi, A., Ru, B. X., Calliess, J.-P., Roberts, S., & Osborne, M. A. (2019). Asynchronous Batch Bayesian Optimisation with Improved Local Penalisation. Oxford University Research Archive (ORA) (University of Oxford), 253–262. https://doi.org/10.48550/arxiv.1901.10452
How many times has this paper been cited?
72 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 Oxford University Research Archive (ORA) (University of Oxford): sign in and open the PDF from this page.
Who wrote this paper?
Ahsan Alvi, Bin Xin Ru, Jan-Peter Calliess, Stephen Roberts, Michael A. Osborne.
What is the DOI of this paper?
10.48550/arxiv.1901.10452, permanently at https://doi.org/10.48550/arxiv.1901.10452. 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.