Paper · 2018 · Open access
Optimization, fast and slow: optimally switching between local and Bayesian optimization
Oxford University Research Archive (ORA) (University of Oxford), 3440–3449 · Published 22 May 2018 · DOI 10.48550/arxiv.1805.08610
In brief
“Optimization, fast and slow: optimally switching between local and Bayesian optimization” is a 2018 paper by Mark McLeod and 2 co-authors, published in Oxford University Research Archive (ORA) (University of Oxford). OpenAlex counts 49 citations as of 19 November 2026, which puts it in the top 8% of works published in 2018 by citations. It is open access: the full text is free to read at Oxford University Research Archive (ORA) (University of Oxford).
- Citations
- 49
- Most cited in
- 2021 (8)
- Field-weighted impact
- 8.38
- References
- 16
- Authors
- 3
Abstract
We develop the first Bayesian Optimization algorithm, BLOSSOM, which selects between multiple alternative acquisition functions and traditional local optimization at each step. This is combined with a novel stopping condition based on expected regret. This pairing allows us to obtain the best characteristics of both local and Bayesian optimization, making efficient use of function evaluations while yielding superior convergence to the global minimum on a selection of optimization problems, and also halting optimization once a principled and intuitive stopping condition has been fulfilled.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
McLeod, M., Osborne, M. A., & Roberts, S. (2018). Optimization, fast and slow: optimally switching between local and Bayesian optimization. Oxford University Research Archive (ORA) (University of Oxford), 3440–3449. https://doi.org/10.48550/arxiv.1805.08610
MLA 9
McLeod, Mark, et al. “Optimization, fast and slow: optimally switching between local and Bayesian optimization.” Oxford University Research Archive (ORA) (University of Oxford), 2018, pp. 3440–3449. https://doi.org/10.48550/arxiv.1805.08610.
Chicago
McLeod, Mark, Michael A. Osborne, and Stephen Roberts. 2018. “Optimization, fast and slow: optimally switching between local and Bayesian optimization.” Oxford University Research Archive (ORA) (University of Oxford): 3440–3449. https://doi.org/10.48550/arxiv.1805.08610.
Harvard
McLeod, M., Osborne, M. A. and Roberts, S. (2018) ‘Optimization, fast and slow: optimally switching between local and Bayesian optimization’, Oxford University Research Archive (ORA) (University of Oxford), pp. 3440–3449. doi:10.48550/arxiv.1805.08610.
IEEE
M. McLeod, M. A. Osborne, and S. Roberts, “Optimization, fast and slow: optimally switching between local and Bayesian optimization,” Oxford University Research Archive (ORA) (University of Oxford), pp. 3440–3449, 2018, doi: 10.48550/arxiv.1805.08610.
BibTeX
@article{mcleod2018optimization,
title = {{Optimization, fast and slow: optimally switching between local and Bayesian optimization}},
author = {McLeod, Mark and Osborne, Michael A. and Roberts, Stephen},
journal = {Oxford University Research Archive (ORA) (University of Oxford)},
year = {2018},
pages = {3440--3449},
doi = {10.48550/arxiv.1805.08610},
url = {https://doi.org/10.48550/arxiv.1805.08610}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2018 | 2 | |
| 2019 | 7 | |
| 2020 | 6 | |
| 2021 | 8 | |
| 2022 | 5 | |
| 2023 | 6 | |
| 2024 | 3 | |
| 2025 | 5 | |
| 2026 | 7 |
Its field-weighted citation impact is 8.38: it has been cited 8.38 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
- Bayesian optimization
- local optimization
- acquisition functions
- hybrid optimization
- anticipated regret
- stopping rules
- flowers
- global 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?
McLeod, M., Osborne, M. A., & Roberts, S. (2018). Optimization, fast and slow: optimally switching between local and Bayesian optimization. Oxford University Research Archive (ORA) (University of Oxford), 3440–3449. https://doi.org/10.48550/arxiv.1805.08610
How many times has this paper been cited?
49 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?
Mark McLeod, Michael A. Osborne, Stephen Roberts.
What is the DOI of this paper?
10.48550/arxiv.1805.08610, permanently at https://doi.org/10.48550/arxiv.1805.08610. 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.