Preprint · 2022 · Open access

On Provably Robust Meta-Bayesian Optimization

Zhongxiang Dai, Yizhou Chen, Haibin Yu, Bryan Kian Hsiang Low, Patrick Jaillet

arXiv (Cornell University) · Published 14 June 2022 · DOI 10.48550/arxiv.2206.06872

Open PDFView at the publisherCite this paper

In brief

“On Provably Robust Meta-Bayesian Optimization” is a 2022 preprint by Zhongxiang Dai and 4 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
2022 (3)
References
39
Authors
5

Abstract

Bayesian optimization (BO) has become popular for sequential optimization of black-box functions. When BO is used to optimize a target function, we often have access to previous evaluations of potentially related functions. This begs the question as to whether we can leverage these previous experiences to accelerate the current BO task through meta-learning (meta-BO), while ensuring robustness against potentially harmful dissimilar tasks that could sabotage the convergence of BO. This paper introduces two scalable and provably robust meta-BO algorithms: robust meta-Gaussian process-upper confidence bound (RM-GP-UCB) and RM-GP-Thompson sampling (RM-GP-TS). We prove that both algorithms are asymptotically no-regret even when some or all previous tasks are dissimilar to the current task, and show that RM-GP-UCB enjoys a better theoretical robustness than RM-GP-TS. We also exploit the theoretical guarantees to optimize the weights assigned to individual previous tasks through regret minimization via online learning, which diminishes the impact of dissimilar tasks and hence further enhances the robustness. Empirical evaluations show that (a) RM-GP-UCB performs effectively and consistently across various applications, and (b) RM-GP-TS, despite being less robust than RM-GP-UCB both in theory and in practice, performs competitively in some scenarios with less dissimilar tasks and is more computationally efficient.

Cite this paper

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

APA 7

Dai, Z., Chen, Y., Yu, H., Low, B. K. H., & Jaillet, P. (2022). On Provably Robust Meta-Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2206.06872

MLA 9

Dai, Zhongxiang, et al. “On Provably Robust Meta-Bayesian Optimization.” arXiv (Cornell University), 2022. https://doi.org/10.48550/arxiv.2206.06872.

Chicago

Dai, Zhongxiang, Yizhou Chen, Haibin Yu, Bryan Kian Hsiang Low, and Patrick Jaillet. 2022. “On Provably Robust Meta-Bayesian Optimization.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.2206.06872.

Harvard

Dai, Z. et al. (2022) ‘On Provably Robust Meta-Bayesian Optimization’, arXiv (Cornell University). doi:10.48550/arxiv.2206.06872.

IEEE

Z. Dai, Y. Chen, H. Yu, B. K. H. Low, and P. Jaillet, “On Provably Robust Meta-Bayesian Optimization,” arXiv (Cornell University), 2022, doi: 10.48550/arxiv.2206.06872.

BibTeX

@misc{dai2022provably,
  title     = {{On Provably Robust Meta-Bayesian Optimization}},
  author    = {Dai, Zhongxiang and Chen, Yizhou and Yu, Haibin and Low, Bryan Kian Hsiang and Jaillet, Patrick},
  howpublished = {arXiv (Cornell University)},
  year      = {2022},
  doi       = {10.48550/arxiv.2206.06872},
  url       = {https://doi.org/10.48550/arxiv.2206.06872}
}

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

Citations by year

YearCitationsShare of the best year
202233
202322
202522
202611

Topic and keywords

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

  • meta-learning
  • robustness
  • Thompson sampling
  • black-box optimization
  • online learning
  • task weighting

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?

Dai, Z., Chen, Y., Yu, H., Low, B. K. H., & Jaillet, P. (2022). On Provably Robust Meta-Bayesian Optimization. arXiv (Cornell University). https://doi.org/10.48550/arxiv.2206.06872

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 PDF from this page.

Who wrote this paper?

Zhongxiang Dai, Yizhou Chen, Haibin Yu, Bryan Kian Hsiang Low, Patrick Jaillet.

What is the DOI of this paper?

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