Preprint · 2021 · Open access

Bayesian Optimistic Optimisation with Exponentially Decaying Regret

Hung Tran-The, Sunil Gupta, Santu Rana, Svetha Venkatesh

arXiv (Cornell University), 10390–10400 · Published 10 May 2021 · DOI 10.48550/arxiv.2105.04332

Open PDFView at the publisherCite this paper

In brief

“Bayesian Optimistic Optimisation with Exponentially Decaying Regret” is a 2021 preprint by Hung Tran-The and 3 co-authors, published in arXiv (Cornell University). OpenAlex counts 1 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
1
Most cited in
2022 (1)
References
27
Authors
4

Abstract

Bayesian optimisation (BO) is a well-known efficient algorithm for finding the global optimum of expensive, black-box functions. The current practical BO algorithms have regret bounds ranging from $\mathcal{O}(\frac{logN}{\sqrt{N}})$ to $\mathcal O(e^{-\sqrt{N}})$, where $N$ is the number of evaluations. This paper explores the possibility of improving the regret bound in the noiseless setting by intertwining concepts from BO and tree-based optimistic optimisation which are based on partitioning the search space. We propose the BOO algorithm, a first practical approach which can achieve an exponential regret bound with order $\mathcal O(N^{-\sqrt{N}})$ under the assumption that the objective function is sampled from a Gaussian process with a Matérn kernel with smoothness parameter $ν> 4 +\frac{D}{2}$, where $D$ is the number of dimensions. We perform experiments on optimisation of various synthetic functions and machine learning hyperparameter tuning tasks and show that our algorithm outperforms baselines.

Cite this paper

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

APA 7

Tran-The, H., Gupta, S., Rana, S., & Venkatesh, S. (2021). Bayesian Optimistic Optimisation with Exponentially Decaying Regret. arXiv (Cornell University), 10390–10400. https://doi.org/10.48550/arxiv.2105.04332

MLA 9

Tran-The, Hung, et al. “Bayesian Optimistic Optimisation with Exponentially Decaying Regret.” arXiv (Cornell University), 2021, pp. 10390–10400. https://doi.org/10.48550/arxiv.2105.04332.

Chicago

Tran-The, Hung, Sunil Gupta, Santu Rana, and Svetha Venkatesh. 2021. “Bayesian Optimistic Optimisation with Exponentially Decaying Regret.” arXiv (Cornell University): 10390–10400. https://doi.org/10.48550/arxiv.2105.04332.

Harvard

Tran-The, H. et al. (2021) ‘Bayesian Optimistic Optimisation with Exponentially Decaying Regret’, arXiv (Cornell University), pp. 10390–10400. doi:10.48550/arxiv.2105.04332.

IEEE

H. Tran-The, S. Gupta, S. Rana, and S. Venkatesh, “Bayesian Optimistic Optimisation with Exponentially Decaying Regret,” arXiv (Cornell University), pp. 10390–10400, 2021, doi: 10.48550/arxiv.2105.04332.

BibTeX

@misc{tranthe2021bayesian,
  title     = {{Bayesian Optimistic Optimisation with Exponentially Decaying Regret}},
  author    = {Tran-The, Hung and Gupta, Sunil and Rana, Santu and Venkatesh, Svetha},
  howpublished = {arXiv (Cornell University)},
  year      = {2021},
  pages     = {10390--10400},
  doi       = {10.48550/arxiv.2105.04332},
  url       = {https://doi.org/10.48550/arxiv.2105.04332}
}

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
  • regret bounds
  • search space partitioning
  • Gaussian processes
  • Matérn kernel
  • hyperparameter optimization
  • black-box optimization

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?

Tran-The, H., Gupta, S., Rana, S., & Venkatesh, S. (2021). Bayesian Optimistic Optimisation with Exponentially Decaying Regret. arXiv (Cornell University), 10390–10400. https://doi.org/10.48550/arxiv.2105.04332

How many times has this paper been cited?

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

Hung Tran-The, Sunil Gupta, Santu Rana, Svetha Venkatesh.

What is the DOI of this paper?

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