Preprint · 2023 · Open access
Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency
arXiv (Cornell University) · Published 23 October 2023 · DOI 10.48550/arxiv.2310.15351
In brief
“Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency” is a 2023 preprint by Sudeep Salgia and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 7 citations as of 19 November 2026. It is open access under a CC BY licence: the full text is free to read at arXiv (Cornell University).
- Citations
- 7
- Most cited in
- 2026 (3)
- References
- 47
- Authors
- 3
Abstract
We consider Bayesian optimization using Gaussian Process models, also referred to as kernel-based bandit optimization. We study the methodology of exploring the domain using random samples drawn from a distribution. We show that this random exploration approach achieves the optimal error rates. Our analysis is based on novel concentration bounds in an infinite dimensional Hilbert space established in this work, which may be of independent interest. We further develop an algorithm based on random exploration with domain shrinking and establish its order-optimal regret guarantees under both noise-free and noisy settings. In the noise-free setting, our analysis closes the existing gap in regret performance and thereby resolves a COLT open problem. The proposed algorithm also enjoys a computational advantage over prevailing methods due to the random exploration that obviates the expensive optimization of a non-convex acquisition function for choosing the query points at each iteration.
Cite this paper
Formatted from the catalogue record. Check names, capitals and page numbers against the paper before you submit.
APA 7
Salgia, S., Vakili, S., & Zhao, Q. Q. (2023). Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2310.15351
MLA 9
Salgia, Sudeep, et al. “Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency.” arXiv (Cornell University), 2023. https://doi.org/10.48550/arxiv.2310.15351.
Chicago
Salgia, Sudeep, Sattar Vakili, and Qing Qi Zhao. 2023. “Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2310.15351.
Harvard
Salgia, S., Vakili, S. and Zhao, Q. Q. (2023) ‘Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency’, arXiv (Cornell University). doi:10.48550/arxiv.2310.15351.
IEEE
S. Salgia, S. Vakili, and Q. Q. Zhao, “Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency,” arXiv (Cornell University), 2023, doi: 10.48550/arxiv.2310.15351.
BibTeX
@misc{salgia2023random,
title = {{Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency}},
author = {Salgia, Sudeep and Vakili, Sattar and Zhao, Qing Qi},
howpublished = {arXiv (Cornell University)},
year = {2023},
doi = {10.48550/arxiv.2310.15351},
url = {https://doi.org/10.48550/arxiv.2310.15351}
}
Download for a reference manager: BibTeX (.bib) · RIS for Zotero, Mendeley and EndNote (.ris)
Citations by year
| Year | Citations | Share of the best year |
|---|---|---|
| 2022 | 1 | |
| 2023 | 1 | |
| 2024 | 1 | |
| 2025 | 1 | |
| 2026 | 3 |
Topic and keywords
Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Bandit Algorithms Research
- Bayesian optimization
- Gaussian process bandits
- random exploration
- concentration bounds
- Hilbert spaces
- acquisition functions
- computational efficiency
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?
Salgia, S., Vakili, S., & Zhao, Q. Q. (2023). Random Exploration in Bayesian Optimization: Order-Optimal Regret and Computational Efficiency. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2310.15351
How many times has this paper been cited?
7 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?
Sudeep Salgia, Sattar Vakili, Qing Qi Zhao.
What is the DOI of this paper?
10.48550/arxiv.2310.15351, permanently at https://doi.org/10.48550/arxiv.2310.15351. 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.