Exploring and Exploiting Model Uncertainty in Bayesian Optimization
Zishi Zhang, Tao Ren, Yijie Peng
Abstract
In this work, we consider the problem of Bayesian Optimization (BO) under reward model uncertainty —that is, when the underlying distribution type of the reward is unknown and potentially intractable to specify. This challenge is particularly evident in many modern applications, where the reward distribution is highly ill-behaved, often non-stationary, multi-modal, or heavy-tailed. In such settings, classical Gaussian Process (GP)-based BO methods often fail due to their strong modeling assumptions. To address this challenge, we propose a novel surrogate model, the infinity-Gaussian Process ( ∞ -GP), which represents a sequential spatial Dirichlet Process mixture with a GP baseline. The ∞ -GP quantifies both value uncertainty and model uncertainty, enabling more flexible modeling of complex reward structures. Combined with Thompson Sampling, the ∞ -GP facilitates principled exploration and exploitation in the distributional space of reward models. Theoretically, we prove that the ∞ -GP surrogate model can approximate a broad class of reward distributions by effectively exploring the distribution space, achieving near-minimax-optimal posterior contraction rates. Empirically, our method outperforms state-of-the-art approaches in various challenging scenarios, including highly non-stationary and heavy-tailed reward settings where classical GP-based BO often fails.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 0c602948-7366-4d73-ae4a-4104f0394b08Builds on11
- NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture SearchXuanyi Dong, Yi YangICLR 2020 · 825 citations
- Unexpected Improvements to Expected Improvement for Bayesian OptimizationSebastian Ament, Samuel Daulton, David Eriksson, Maximilian Balandat et al.NeurIPS 2023 · 280 citations
- Efficiently sampling functions from Gaussian process posteriorsJames T. Wilson, Viacheslav Borovitskiy, Alexander Terenin, Peter Mostowsky et al.ICML 2020 · 186 citations
- RLPrompt: Optimizing Discrete Text Prompts with Reinforcement LearningMingkai Deng, Jianyu Wang, Cheng-Ping Hsieh, Yihan Wang et al.EMNLP 2022 · 141 citations
- Misspecified Gaussian Process Bandit OptimizationIlija Bogunovic, Andreas KrauseNeurIPS 2021 · 69 citations
Related papers
- BayeSQP: Bayesian Optimization through Sequential Quadratic ProgrammingPaul Brunzema, Sebastian TrimpeNeurIPS 2025 · 7 citations
- Modulating Surrogates for Bayesian OptimizationErik Bodin, Markus Kaiser, Ieva Kazlauskaite, Zhenwen Dai et al.ICML 2020 · 11 citations
- Policy Search via Bayesian Optimization with Temporal Difference Gaussian ProcessesArmin Lederer, Anuj Srivastava, Marco Bagatella, Andreas KrauseICML 2026
- Thompson Sampling in Function Spaces via Neural OperatorsRafael Oliveira, Xuesong Wang, Kian Ming A. Chai, Edwin V. BonillaNeurIPS 2025 · 2 citations
- Objective Bound Conditional Gaussian Process for Bayesian OptimizationTaewon Jeong, Heeyoung KimICML 2021 · 3 citations
