Preprint · 2020 · Open access

Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces

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

arXiv (Cornell University), 33, 16271–16281 · Published 5 September 2020 · DOI 10.48550/arxiv.2009.02539

Open PDFView at the publisherCite this paper

In brief

“Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces” is a 2020 preprint by Hung Tran-The and 4 co-authors, published in arXiv (Cornell University). OpenAlex counts 6 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
6
Most cited in
2025 (4)
References
32
Authors
5

Abstract

Bayesian optimisation is a popular method for efficient optimisation of expensive black-box functions. Traditionally, BO assumes that the search space is known. However, in many problems, this assumption does not hold. To this end, we propose a novel BO algorithm which expands (and shifts) the search space over iterations based on controlling the expansion rate thought a hyperharmonic series. Further, we propose another variant of our algorithm that scales to high dimensions. We show theoretically that for both our algorithms, the cumulative regret grows at sub-linear rates. Our experiments with synthetic and real-world optimisation tasks demonstrate the superiority of our algorithms over the current state-of-the-art methods for Bayesian optimisation in unknown search space.

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., Ha, H., & Venkatesh, S. (2020). Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces. arXiv (Cornell University), 33, 16271–16281. https://doi.org/10.48550/arxiv.2009.02539

MLA 9

Tran-The, Hung, et al. “Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces.” arXiv (Cornell University), vol. 33, 2020, pp. 16271–16281. https://doi.org/10.48550/arxiv.2009.02539.

Chicago

Tran-The, Hung, Sunil Gupta, Santu Rana, Huong Ha, and Svetha Venkatesh. 2020. “Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces.” arXiv (Cornell University) 33: 16271–16281. https://doi.org/10.48550/arxiv.2009.02539.

Harvard

Tran-The, H. et al. (2020) ‘Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces’, arXiv (Cornell University), 33, pp. 16271–16281. doi:10.48550/arxiv.2009.02539.

IEEE

H. Tran-The, S. Gupta, S. Rana, H. Ha, and S. Venkatesh, “Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces,” arXiv (Cornell University), vol. 33, pp. 16271–16281, 2020, doi: 10.48550/arxiv.2009.02539.

BibTeX

@misc{tranthe2020linear,
  title     = {{Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces}},
  author    = {Tran-The, Hung and Gupta, Sunil and Rana, Santu and Ha, Huong and Venkatesh, Svetha},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  volume    = {33},
  pages     = {16271--16281},
  doi       = {10.48550/arxiv.2009.02539},
  url       = {https://doi.org/10.48550/arxiv.2009.02539}
}

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

Citations by year

YearCitationsShare of the best year
202111
202544
202611

Topic and keywords

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

  • Bayesian optimization
  • regret bounds
  • black-box optimization
  • search space expansion
  • high-dimensional 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., Ha, H., & Venkatesh, S. (2020). Sub-linear Regret Bounds for Bayesian Optimisation in Unknown Search Spaces. arXiv (Cornell University), 33, 16271–16281. https://doi.org/10.48550/arxiv.2009.02539

How many times has this paper been cited?

6 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, Huong Ha, Svetha Venkatesh.

What is the DOI of this paper?

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