Posterior Sampling-Based Bayesian Optimization with Tighter Bayesian Regret Bounds

2023-11-07 · Shion Takeno, Yu Inatsu, Masayuki Karasuyama, Ichiro Takeuchi

Among various acquisition functions (AFs) in Bayesian optimization (BO), Gaussian process upper confidence bound (GP-UCB) and Thompson sampling (TS) are well-known options with established theoretical properties regarding Bayesian cumulative regret (BCR). Recently, it has been shown that a randomized variant of GP-UCB achieves a tighter BCR bound compared with GP-UCB, which we call the tighter BCR bound for brevity. Inspired by this study, this paper first shows that TS achieves the tighter BCR bound. On the other hand, GP-UCB and TS often practically suffer from manual hyperparameter tuning and over-exploration issues, respectively. Therefore, we analyze yet another AF called a probability of improvement from the maximum of a sample path (PIMS). We show that PIMS achieves the tighter BCR bound and avoids the hyperparameter tuning, unlike GP-UCB. Furthermore, we demonstrate a wide range of experiments, focusing on the effectiveness of PIMS that mitigates the practical issues of GP-UCB and TS.

📄 PDF Abstract BibTeX arXiv:2311.03760

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian OptimizationThompson Sampling

Methods 이 논문이 사용한 방법론

TS Spatio-temporal features extraction that measure the stabilty. The proposed method is based on a compression algorithm named Run Length Encoding. The workflow of the method is…

Gaussian Process Gaussian Processes are non-parametric models for approximating functions. They rely upon a measure of similarity between points (the kernel function) to predict the value for…

Adaptive Sampling for Estimating Distributions: A Bayesian Upper Confidence Bound Approach

2020-12-08 · Dhruva Kartik, Neeraj Sood, Urbashi Mitra, Tara Javidi

The problem of adaptive sampling for estimating probability mass functions (pmf) uniformly well is considered. Performance of the sampling strategy is measured in terms of the worst-case mean squared error. A Bayesian va…

Diversified Sampling for Batched Bayesian Optimization with Determinantal Point Processes

2021-10-22 · Elvis Nava, Mojmír Mutný, Andreas Krause

In Bayesian Optimization (BO) we study black-box function optimization with noisy point evaluations and Bayesian priors. Convergence of BO can be greatly sped up by batching, where multiple evaluations of the black-box f…

Bayesian Optimization Diversity Point Processes Thompson Sampling

Scalable Nonparametric Sampling from Multimodal Posteriors with the Posterior Bootstrap

2019-02-08 · Edwin Fong, Simon Lyddon, Chris Holmes

Increasingly complex datasets pose a number of challenges for Bayesian inference. Conventional posterior sampling based on Markov chain Monte Carlo can be too computationally intensive, is serial in nature and mixes poor…

Bayesian Inference regression

Regret Analysis of Posterior Sampling-Based Expected Improvement for Bayesian Optimization

2025-07-13 · Shion Takeno, Yu Inatsu, Masayuki Karasuyama, Ichiro Takeuchi arxiv

Bayesian optimization is a powerful tool for optimizing an expensive-to-evaluate black-box function. In particular, the effectiveness of expected improvement (EI) has been demonstrated in a wide range of applications. Ho…

BALSON: Bayesian Least Squares Optimization with Nonnegative L1-Norm Constraint

2018-07-08 · Jiyang Xie, Zhanyu Ma, Guo-Qiang Zhang, Jing-Hao Xue 외

A Bayesian approach termed BAyesian Least Squares Optimization with Nonnegative L1-norm constraint (BALSON) is proposed. The error distribution of data fitting is described by Gaussian likelihood. The parameter distribut…