Preprint · 2021 · Open access

CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels

Tan, Jian, Niv Nayman, Mengchang Wang

arXiv (Cornell University) · Published 13 January 2021 · DOI 10.48550/arxiv.2101.05147

Open PDFView at the publisherCite this paper

In brief

“CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels” is a 2021 preprint by Tan, Jian and 2 co-authors, published in arXiv (Cornell University). OpenAlex counts 7 citations as of 19 November 2026. It is open access: the full text is free to read at arXiv (Cornell University).

Citations
7
Most cited in
2022 (3)
References
41
Authors
3

Abstract

Bayesian optimization is a popular method for optimizing expensive black-box functions. Yet it oftentimes struggles in high dimensions where the computation could be prohibitively heavy. To alleviate this problem, we introduce Coordinate backoff Bayesian Optimization (CobBO) with two-stage kernels. During each round, the first stage uses a simple coarse kernel that sacrifices the approximation accuracy for computational efficiency. It captures the global landscape by purposely smoothing away local fluctuations. Then, in the second stage of the same round, past observed points in the full space are projected to the selected subspace to form virtual points. These virtual points, along with the means and variances of their unknown function values estimated using the simple kernel of the first stage, are fitted to a more sophisticated kernel model in the second stage. Within the selected low dimensional subspace, the computational cost of conducting Bayesian optimization therein becomes affordable. To further enhance the performance, a sequence of consecutive observations in the same subspace are collected, which can effectively refine the approximation of the function. This refinement lasts until a stopping rule is met determining when to back off from a certain subspace and switch to another. This decoupling significantly reduces the computational burden in high dimensions, which fully leverages the observations in the whole space rather than only relying on observations in each coordinate subspace. Extensive evaluations show that CobBO finds solutions comparable to or better than other state-of-the-art methods for dimensions ranging from tens to hundreds, while reducing both the trial complexity and computational costs.

Cite this paper

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

APA 7

Jian, T., Nayman, N., & Wang, M. (2021). CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2101.05147

MLA 9

Jian, Tan,, et al. “CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels.” arXiv (Cornell University), 2021. https://doi.org/10.48550/arxiv.2101.05147.

Chicago

Jian, Tan,, Niv Nayman, and Mengchang Wang. 2021. “CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2101.05147.

Harvard

Jian, T., Nayman, N. and Wang, M. (2021) ‘CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels’, arXiv (Cornell University). doi:10.48550/arxiv.2101.05147.

IEEE

T. Jian, N. Nayman, and M. Wang, “CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels,” arXiv (Cornell University), 2021, doi: 10.48550/arxiv.2101.05147.

BibTeX

@misc{jian2021cobbo,
  title     = {{CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels}},
  author    = {Jian, Tan, and Nayman, Niv and Wang, Mengchang},
  howpublished = {arXiv (Cornell University)},
  year      = {2021},
  doi       = {10.48550/arxiv.2101.05147},
  url       = {https://doi.org/10.48550/arxiv.2101.05147}
}

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

Citations by year

YearCitationsShare of the best year
202111
202233
202322
202411

Topic and keywords

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

  • Bayesian optimization
  • high-dimensional optimization
  • black-box optimization
  • subspace selection
  • virtual points
  • kernel approximation
  • computational efficiency
  • stopping rules

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?

Jian, T., Nayman, N., & Wang, M. (2021). CobBO: Coordinate Backoff Bayesian Optimization with Two-Stage Kernels. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2101.05147

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?

Tan, Jian, Niv Nayman, Mengchang Wang.

What is the DOI of this paper?

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