Preprint · 2026 · Open access

Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization

Satoshi Katayama, Shoyo Hunt, Shintaro Masuda, Masayuki Karasuyama

arXiv (Cornell University) · Published 7 October 2026 · DOI 10.48550/arxiv.2610.10186

Open PDFView at the publisherCite this paper

In brief

“Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization” is a 2026 preprint by Satoshi Katayama and 3 co-authors, 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
16
Authors
4

Abstract

Bayesian optimization (BO) is widely used as a standard approach for expensive black-box optimization. However, BO algorithms often involve parameters that must be specified in advance, and their performance can strongly depend on these choices. We propose a framework for optimizing such parameters using sample paths drawn from a Gaussian process (GP) inferred from the information available at the start of BO. We use cumulative regret as the performance metric for a BO algorithm. By running the BO algorithm on the generated sample paths, we obtain an empirical estimate of its expected cumulative regret for a given parameter configuration. Optimizing this estimate allows us to identify parameter configurations that, given the currently available information, are expected to achieve low cumulative regret. Since this parameter optimization is itself a black-box optimization problem, we employ another BO procedure to solve it, which we refer to as outer BO. Through experiments, we demonstrate that the proposed framework can effectively select parameter configurations that achieve strong performance among a range of candidate configurations.

Cite this paper

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

APA 7

Katayama, S., Hunt, S., Masuda, S., & Karasuyama, M. (2026). Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2610.10186

MLA 9

Katayama, Satoshi, et al. “Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization.” arXiv (Cornell University), 2026. https://doi.org/10.48550/arxiv.2610.10186.

Chicago

Katayama, Satoshi, Shoyo Hunt, Shintaro Masuda, and Masayuki Karasuyama. 2026. “Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2610.10186.

Harvard

Katayama, S. et al. (2026) ‘Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2610.10186.

IEEE

S. Katayama, S. Hunt, S. Masuda, and M. Karasuyama, “Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization,” arXiv (Cornell University), 2026, doi: 10.48550/arxiv.2610.10186.

BibTeX

@misc{katayama2026training,
  title     = {{Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization}},
  author    = {Katayama, Satoshi and Hunt, Shoyo and Masuda, Shintaro and Karasuyama, Masayuki},
  howpublished = {arXiv (Cornell University)},
  year      = {2026},
  doi       = {10.48550/arxiv.2610.10186},
  url       = {https://doi.org/10.48550/arxiv.2610.10186}
}

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
  • hyperparameter optimization
  • Gaussian processes
  • cumulative regret
  • black-box optimization
  • expensive optimization
  • parameter selection

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?

Katayama, S., Hunt, S., Masuda, S., & Karasuyama, M. (2026). Pre-training of Bayesian Optimization Algorithm through Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2610.10186

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?

Satoshi Katayama, Shoyo Hunt, Shintaro Masuda, Masayuki Karasuyama.

What is the DOI of this paper?

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