TS-RSR: A provably efficient approach for batch Bayesian Optimization
원문 초록
This paper presents a new approach for batch Bayesian Optimization (BO) called Thompson Sampling-Regret to Sigma Ratio directed sampling (TS-RSR), where we sample a new batch of actions by minimizing a Thompson Sampling approximation of a regret to uncertainty ratio. Our sampling objective is able to coordinate the actions chosen in each batch in a way that minimizes redundancy between points whilst focusing on points with high predictive means or high uncertainty. Theoretically, we provide rigorous convergence guarantees on our algorithm's regret, and numerically, we demonstrate that our method attains state-of-the-art performance on a range of challenging synthetic and realistic test functions, where it outperforms several competitive benchmark batch BO algorithms.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Steering Generative Models with Experimental Data for Protein Fitness Optimization
Bayesian Optimization with Inexact Acquisition: Is Random Grid Search Sufficient?
Simplifying Bayesian Optimization Via In-Context Direct Optimum Sampling
An Adversarial Analysis of Thompson Sampling for Full-information Online Learning: from Finite to Infinite Action Spaces
On Improved Regret Bounds In Bayesian Optimization with Gaussian Noise
BOTS: Batch Bayesian Optimization of Extended Thompson Sampling for Severely Episode-Limited RL Settings
토론
이 논문과 연결된 포럼 글이 아직 없습니다.