arXiv Machine Learning

Bayesian optimization with kernel ensembles and disagreement-based acquisition for source localization and acoustic inversion

arXiv AI
Aug 26

Enhancing Bayesian Optimization and Active Learning Through Kernel Diversity

The paper introduces KENDO, a unified framework that combines Ensemble Gaussian Processes with disagreement‑aware acquisition strategies to address hyperparameter selection in Bayesian optimization and active learning. By replacing costly hyperparameter sampling with a kernel ensemble and adaptive Bayesian weighting, KENDO‑BO and KENDO‑AL provide self‑correcting mechanisms tailored to their respective tasks. Experiments on synthetic and real‑world benchmarks show that KENDO‑BO matches or outperforms state‑of‑the‑art methods while cutting computational cost up to fivefold, and KENDO‑AL delivers better predictive calibration with up to 27‑times speedup compared to MCMC‑based baselines.

By Heng Zhang, Haotian Xiang, Qin Lu, Konstantinos D. Polyzos, Tara Javidi
arXiv Machine Learning
Sep 18

Online Adaptive Kernel Mixing for Gaussian Process Decision Making

The paper introduces HACK GPs, a method that treats kernel selection for Gaussian Processes as an online learning problem with expert advice. Each candidate kernel is viewed as a GP expert, and a distribution over these experts is updated online using AdaHedge based on a loss that reflects both function fit and task alignment. Two variants—Mixture of Gaussians and categorical sampling—are presented, with theoretical guarantees that the weight concentrates on the best kernel under a loss‑gap condition, and empirical results show robust performance across Bayesian optimization, level set estimation, and Bayesian active learning compared to standard kernels and simple ensembles.

By Kavin Aravindan, Mani Tej Sriram, Gautam Dasarathy, Tejas Bodas
arXiv AI
6d ago

Bayesian Optimization with Fisher Information Geometry: Gradient Bounds and Trust-Region Methods

The paper investigates Bayesian optimization using information geometry, deriving a local sensitivity tensor from the Fisher information metric that bounds the gradient of reparameterizable acquisition functions. This framework explains vanishing-gradient issues in high-dimensional settings and unifies heuristics like RAASP and dimension-scaled lengthscales. Leveraging this insight, the authors introduce FITR, a trust‑region BO method that replaces lengthscale scaling with local pullback‑Fisher weights, achieving competitive performance on GP benchmarks and extending naturally to non‑isotropic surrogates.

By Saksham Kiroriwal, Julius Pfrommer, J\"urgen Beyerer