Preprint · 2020 · Open access

A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.

Sudeep Salgia, Sattar Vakili, Qing Qi Zhao

arXiv (Cornell University) · Published 27 October 2020

Open full textCite this paper

In brief

“A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.” is a 2020 preprint by Sudeep Salgia and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 2 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
2
Most cited in
2021 (2)
References
31
Authors
3

Abstract

We consider sequential optimization of an unknown function under Gaussian process models. We develop a computationally efficient algorithm that reduces the complexity of the prevailing GP-UCB family of algorithms by a factor of $O(T^{2d-1})$ (where $T$ is the time horizon and $d$ the dimension of the function domain). The algorithm is also shown to have order-optimal regret performance (up to a poly-logarithmic factor). The basic structure of the proposed algorithm is a tree-based \emph{localized} search strategy guided by a localized optimization procedure for finding function values exceeding an iteratively updated threshold. More specifically, the global optimum is approached through a sequence of localized searches in the domain of the function guided by an iterative search in the range of the function.

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. (2020). A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models. arXiv (Cornell University). https://arxiv.org/pdf/2010.13997

MLA 9

Salgia, Sudeep, et al. “A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.” arXiv (Cornell University), 2020. https://arxiv.org/pdf/2010.13997.

Chicago

Salgia, Sudeep, Sattar Vakili, and Qing Qi Zhao. 2020. “A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.” arXiv (Cornell University). https://arxiv.org/pdf/2010.13997.

Harvard

Salgia, S., Vakili, S. and Zhao, Q. Q. (2020) ‘A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.’, arXiv (Cornell University). Available at: https://arxiv.org/pdf/2010.13997.

IEEE

S. Salgia, S. Vakili, and Q. Q. Zhao, “A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.,” arXiv (Cornell University), 2020.

BibTeX

@misc{salgia2020computationally,
  title     = {{A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models.}},
  author    = {Salgia, Sudeep and Vakili, Sattar and Zhao, Qing Qi},
  howpublished = {arXiv (Cornell University)},
  year      = {2020},
  url       = {https://arxiv.org/pdf/2010.13997}
}

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

  • black-box optimization
  • Gaussian processes
  • sequential optimization
  • computational efficiency
  • regret bounds
  • tree search
  • iterative thresholding
  • 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?

Salgia, S., Vakili, S., & Zhao, Q. Q. (2020). A Computationally Efficient Approach to Black-box Optimization using Gaussian Process Models. arXiv (Cornell University). https://arxiv.org/pdf/2010.13997

How many times has this paper been cited?

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

Sudeep Salgia, Sattar Vakili, Qing Qi Zhao.

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.