Preprint · 2020 · Open access

Regret Bounds for Noise-Free Bayesian Optimization.

Sattar Vakili, Victor Picheny, Nicolas Durrande

arXiv (Cornell University) · Published 12 February 2020

Open full textCite this paper

In brief

“Regret Bounds for Noise-Free Bayesian Optimization.” is a 2020 preprint by Sattar Vakili and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 8 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
8
Most cited in
2021 (4)
References
22
Authors
3

Abstract

Bayesian optimisation is a powerful method for non-convex black-box optimization in low data regimes. However, the question of establishing tight upper bounds for common algorithms in the noiseless setting remains a largely open question. In this paper, we establish new and tightest bounds for two algorithms, namely GP-UCB and Thompson sampling, under the assumption that the objective function is smooth in terms of having a bounded norm in a Matern RKHS. Importantly, unlike several related works, we do not consider perfect knowledge of the kernel of the Gaussian process emulator used within the Bayesian optimization loop. This allows us to provide results for practical algorithms that sequentially estimate the Gaussian process kernel parameters from the available data.

Cite this paper

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

APA 7

Vakili, S., Picheny, V., & Durrande, N. (2020). Regret Bounds for Noise-Free Bayesian Optimization. arXiv (Cornell University). https://arxiv.org/pdf/2002.05096.pdf

MLA 9

Vakili, Sattar, et al. “Regret Bounds for Noise-Free Bayesian Optimization.” arXiv (Cornell University), 2020. https://arxiv.org/pdf/2002.05096.pdf.

Chicago

Vakili, Sattar, Victor Picheny, and Nicolas Durrande. 2020. “Regret Bounds for Noise-Free Bayesian Optimization.” arXiv (Cornell University). https://arxiv.org/pdf/2002.05096.pdf.

Harvard

Vakili, S., Picheny, V. and Durrande, N. (2020) ‘Regret Bounds for Noise-Free Bayesian Optimization.’, arXiv (Cornell University). Available at: https://arxiv.org/pdf/2002.05096.pdf.

IEEE

S. Vakili, V. Picheny, and N. Durrande, “Regret Bounds for Noise-Free Bayesian Optimization.,” arXiv (Cornell University), 2020.

BibTeX

@misc{vakili2020regret,
  title     = {{Regret Bounds for Noise-Free Bayesian Optimization.}},
  author    = {Vakili, Sattar and Picheny, Victor and Durrande, Nicolas},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  url       = {https://arxiv.org/pdf/2002.05096.pdf}
}

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

Citations by year

YearCitationsShare of the best year
202022
202144
202211
202311

Topic and keywords

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

  • Bayesian optimization
  • regret bounds
  • Thompson sampling
  • Matérn kernel
  • reproducing kernel Hilbert space
  • black-box optimization
  • non-convex 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?

Vakili, S., Picheny, V., & Durrande, N. (2020). Regret Bounds for Noise-Free Bayesian Optimization. arXiv (Cornell University). https://arxiv.org/pdf/2002.05096.pdf

How many times has this paper been cited?

8 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 full text from this page.

Who wrote this paper?

Sattar Vakili, Victor Picheny, Nicolas Durrande.

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.