Enhancing Bayesian Optimization and Active Learning Through Kernel Diversity
Not on the map. Why?
Abstract (arXiv)
Hyperparameter selection remains a key challenge in Bayesian optimization (BO) and Bayesian active learning (AL), as model misspecification can lead to suboptimal performance, while more accurate fully Bayesian treatments typically rely on computationally expensive MCMC sampling. This paper proposes a unified framework, KENDO (Kernel ENsemble Disagreement-aware Operator), that integrates Ensemble Gaussian Processes (EGP) with disagreement-aware acquisition strategies. The central idea is to replace hyperparameter sampling with a kernel ensemble and adaptive Bayesian weighting, combined with disagreement-aware acquisition strategies. Within this unified framework, we instantiate KENDO-BO for BO and KENDO-AL for Bayesian AL, demonstrating that both arise from a common self-correcting mechanism with task-specific acquisition objectives. We further extend the approach to multi-objective optimization via random scalarization that preserves the single-optimizer conditioning structure. Thorough numerical tests on synthetic and real-world benchmarks across single-objective optimization, multi-objective optimization, and active learning demonstrate that (i) KENDO-BO achieves competitive or superior optimization performance compared to state-of-the-art methods while reducing computational overhead by up to 5× and (ii) KENDO-AL achieves superior predictive calibration over MCMC-based active learning baselines with up to 27× speedup.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 47 references that are in the map. First posted on arXiv 25 Aug 2026.
Builds on
21 of 47 references.
References · 21
- 2018A Tutorial on Bayesian Optimizationcited by 734
- 2015Deep Kernel Learningcited by 440
- 2019BatchBALD: Efficient and Diverse Batch Acquisition for Deep Bayesian Active Learningcited by 428
- 2014Scalable Variational Gaussian Process Classificationcited by 226
- 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 202
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 201
- 2020Differentiable Expected Hypervolume Improvement for Parallel Multi-Objective Bayesian Optimizationcited by 176
- 2020Efficiently Sampling Functions from Gaussian Process Posteriorscited by 125
- 2021Parallel Bayesian Optimization of Multiple Noisy Objectives with Expected Hypervolume Improvementcited by 115
- 2015Batch Bayesian Optimization via Local Penalizationcited by 103
- 2017Constrained Bayesian Optimization with Noisy Experimentscited by 103
- 2018A Flexible Framework for Multi-Objective Bayesian Optimization using Random Scalarizationscited by 98
9 more
- 2015Predictive Entropy Search for Multi-objective Bayesian Optimizationcited by 88
- 2013Structure Discovery in Nonparametric Regression through Compositional Kernel Searchcited by 86
- 2020Max-value Entropy Search for Multi-Objective Bayesian Optimization with Constraintscited by 81
- 2022Joint Entropy Search for Maximally-Informed Bayesian Optimizationcited by 55
- 2021GIBBON: General-purpose Information-Based Bayesian OptimisatioNcited by 47
- 2022Joint Entropy Search for Multi-objective Bayesian Optimizationcited by 45
- 2022Bayesian Active Learning with Fully Bayesian Gaussian Processescited by 26
- 2022Surrogate modeling for Bayesian optimization beyond a single Gaussian processcited by 22
- 2023Self-Correcting Bayesian Optimization through Bayesian Active Learningcited by 22
Built on by
Citing papers per year: 2026: 1.
1 paper.