Preprint · 2018 · Open access

New Heuristics for Parallel and Scalable Bayesian Optimization

Ran Rubin

arXiv (Cornell University) · Published 1 July 2018 · DOI 10.48550/arxiv.1807.00373

Open PDFView at the publisherCite this paper

In brief

“New Heuristics for Parallel and Scalable Bayesian Optimization” is a 2018 preprint by Ran Rubin, published in arXiv (Cornell University). OpenAlex counts 0 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
0
References
30
Authors
1

Abstract

Bayesian optimization has emerged as a strong candidate tool for global optimization of functions with expensive evaluation costs. However, due to the dynamic nature of research in Bayesian approaches, and the evolution of computing technology, using Bayesian optimization in a parallel computing environment remains a challenge for the non-expert. In this report, I review the state-of-the-art in parallel and scalable Bayesian optimization methods. In addition, I propose practical ways to avoid a few of the pitfalls of Bayesian optimization, such as oversampling of edge parameters and over-exploitation of high performance parameters. Finally, I provide relatively simple, heuristic algorithms, along with their open source software implementations, that can be immediately and easily deployed in any computing environment.

Cite this paper

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

APA 7

Rubin, R. (2018). New Heuristics for Parallel and Scalable Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1807.00373

MLA 9

Rubin, Ran. “New Heuristics for Parallel and Scalable Bayesian Optimization.” arXiv (Cornell University), 2018. https://doi.org/10.48550/arxiv.1807.00373.

Chicago

Rubin, Ran. 2018. “New Heuristics for Parallel and Scalable Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1807.00373.

Harvard

Rubin, R. (2018) ‘New Heuristics for Parallel and Scalable Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.1807.00373.

IEEE

R. Rubin, “New Heuristics for Parallel and Scalable Bayesian Optimization,” arXiv (Cornell University), 2018, doi: 10.48550/arxiv.1807.00373.

BibTeX

@misc{rubin2018heuristics,
  title     = {{New Heuristics for Parallel and Scalable Bayesian Optimization}},
  author    = {Rubin, Ran},
  howpublished = {arXiv (Cornell University)},
  year      = {2018},
  doi       = {10.48550/arxiv.1807.00373},
  url       = {https://doi.org/10.48550/arxiv.1807.00373}
}

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

Topic and keywords

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

  • Bayesian optimization
  • scalable optimization
  • heuristics
  • expensive function evaluations
  • global optimization
  • overexploitation
  • open source software

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?

Rubin, R. (2018). New Heuristics for Parallel and Scalable Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1807.00373

How many times has this paper been cited?

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

Ran Rubin.

What is the DOI of this paper?

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