Provably Efficient Bayesian Optimization with Unknown Gaussian Process Hyperparameter Estimation
Not on the map. Why?
Abstract (arXiv)
Gaussian process (GP) based Bayesian optimization (BO) is a powerful method for optimizing black-box functions efficiently. The practical performance and theoretical guarantees of this approach depend on having the correct GP hyperparameter values, which are usually unknown in advance and need to be estimated from the observed data. However, in practice, these estimations could be incorrect due to biased data sampling strategies used in BO. This can lead to degraded performance and break the sub-linear global convergence guarantee of BO. To address this issue, we propose a new BO method that can sub-linearly converge to the objective function's global optimum even when the true GP hyperparameters are unknown in advance and need to be estimated from the observed data. Our method uses a multi-armed bandit technique (EXP3) to add random data points to the BO process, and employs a novel training loss function for the GP hyperparameter estimation process that ensures consistent estimation. We further provide theoretical analysis of our proposed method. Finally, we demonstrate empirically that our method outperforms existing approaches on various synthetic and real-world problems.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 21 of its 62 references that are in the map. First posted on arXiv 12 Jun 2023.
Builds on
21 of 62 references.
References · 21
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2018A Tutorial on Bayesian Optimizationcited by 744
- 2015Scalable Bayesian Optimization Using Deep Neural Networkscited by 284
- 2018Neural Architecture Search with Bayesian Optimisation and Optimal Transportcited by 195
- 2021HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPOcited by 112
- 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 83
- 2021On Statistical Bias In Active Learning: How and When To Fix Itcited by 75
- 2022Automated Reinforcement Learning (AutoRL): A Survey and Open Problemscited by 70
- 2022πBO: Augmenting Acquisition Functions with User Beliefs for Bayesian Optimizationcited by 70
- 2020Provably Efficient Online Hyperparameter Optimization with Population-Based Banditscited by 63
- 2021Misspecified Gaussian Process Bandit Optimizationcited by 55
- 2019No-Regret Bayesian Optimization with Unknown Hyperparameterscited by 51
9 more
- 2016Time-Varying Gaussian Process Bandit Optimizationcited by 50
- 2021LassoBench: A High-Dimensional Hyperparameter Optimization Benchmark Suite for Lassocited by 41
- 2016Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimationcited by 40
- 2014Theoretical Analysis of Bayesian Optimisation with Unknown Gaussian Process Hyper-Parameterscited by 31
- 2020Gryffin: An algorithm for Bayesian optimization of categorical variables informed by expert knowledgecited by 30
- 2023Self-Correcting Bayesian Optimization through Bayesian Active Learningcited by 22
- 2018Tight Regret Bounds for Bayesian Optimization in One Dimensioncited by 20
- 2019Accelerating Experimental Design by Incorporating Experimenter Hunchescited by 14
- 2021Lenient Regret and Good-Action Identification in Gaussian Process Banditscited by 12
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.