Preprint · 2020 · Open access

Simple and Scalable Parallelized Bayesian Optimization

Masahiro Nomura

arXiv (Cornell University) · Published 24 June 2020 · DOI 10.48550/arxiv.2006.13600

Open PDFView at the publisherCite this paper

In brief

“Simple and Scalable Parallelized Bayesian Optimization” is a 2020 preprint by Masahiro Nomura, published in arXiv (Cornell University). OpenAlex counts 2 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
2
Most cited in
2024 (2)
References
31
Authors
1

Abstract

In recent years, leveraging parallel and distributed computational resources has become essential to solve problems of high computational cost. Bayesian optimization (BO) has shown attractive results in those expensive-to-evaluate problems such as hyperparameter optimization of machine learning algorithms. While many parallel BO methods have been developed to search efficiently utilizing these computational resources, these methods assumed synchronous settings or were not scalable. In this paper, we propose a simple and scalable BO method for asynchronous parallel settings. Experiments are carried out with a benchmark function and hyperparameter optimization of multi-layer perceptrons, which demonstrate the promising performance of the proposed method.

Cite this paper

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

APA 7

Nomura, M. (2020). Simple and Scalable Parallelized Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2006.13600

MLA 9

Nomura, Masahiro. “Simple and Scalable Parallelized Bayesian Optimization.” arXiv (Cornell University), 2020. https://doi.org/10.48550/arxiv.2006.13600.

Chicago

Nomura, Masahiro. 2020. “Simple and Scalable Parallelized Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2006.13600.

Harvard

Nomura, M. (2020) ‘Simple and Scalable Parallelized Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2006.13600.

IEEE

M. Nomura, “Simple and Scalable Parallelized Bayesian Optimization,” arXiv (Cornell University), 2020, doi: 10.48550/arxiv.2006.13600.

BibTeX

@misc{nomura2020simple,
  title     = {{Simple and Scalable Parallelized Bayesian Optimization}},
  author    = {Nomura, Masahiro},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  doi       = {10.48550/arxiv.2006.13600},
  url       = {https://doi.org/10.48550/arxiv.2006.13600}
}

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
  • asynchronous parallelism
  • scalability
  • hyperparameter optimization
  • expensive-to-evaluate functions
  • multilayer perceptron

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?

Nomura, M. (2020). Simple and Scalable Parallelized Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2006.13600

How many times has this paper been cited?

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

Masahiro Nomura.

What is the DOI of this paper?

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