paper-with-me

홈 › Papers

Gaussian Process Thompson Sampling via Rootfinding

2024-10-10 · Taiwo A. Adebiyi, Bach Do, Ruda Zhang

Thompson sampling (TS) is a simple, effective stochastic policy in Bayesian decision making. It samples the posterior belief about the reward profile and optimizes the sample to obtain a candidate decision. In continuous optimization, the posterior of the objective function is often a Gaussian process (GP), whose sample paths have numerous local optima, making their global optimization challenging. In this work, we introduce an efficient global optimization strategy for GP-TS that carefully selects starting points for gradient-based multi-start optimizers. It identifies all local optima of the prior sample via univariate global rootfinding, and optimizes the posterior sample using a differentiable, decoupled representation. We demonstrate remarkable improvement in the global optimization of GP posterior samples, especially in high dimensions. This leads to dramatic improvements in the overall performance of Bayesian optimization using GP-TS acquisition functions, surprisingly outperforming alternatives like GP-UCB and EI.

📄 PDF Abstract BibTeX arXiv:2410.08071

Code (0)

등록된 구현이 없습니다.

Tasks

Bayesian OptimizationDecision Makingglobal-optimizationThompson Sampling

Methods 이 논문이 사용한 방법론

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…

Similar Papers 제목 키워드 기반

Optimizing Posterior Samples for Bayesian Optimization via Rootfinding

2024-10-29 · Taiwo A. Adebiyi, Bach Do, Ruda Zhang

Bayesian optimization devolves the global optimization of a costly objective function to the global optimization of a sequence of acquisition functions. This inner-loop optimization can be catastrophically difficult if i…

Bayesian Optimizationglobal-optimizationThompson Sampling

Frequentist Regret Analysis of Gaussian Process Thompson Sampling via Fractional Posteriors

2026-02-16 · Somjit Roy, Prateek Jaiswal, Anirban Bhattacharya, Debdeep Pati 외 arxiv

We study Gaussian Process Thompson Sampling (GP-TS) for sequential decision-making over compact, continuous action spaces and provide a frequentist regret analysis based on fractional Gaussian process posteriors, without…

Distributed Thompson sampling under constrained communication

2024-10-21 · Saba Zerefa, Zhaolin Ren, Haitong Ma, Na Li

In Bayesian optimization, a black-box function is maximized via the use of a surrogate model. We apply distributed Thompson sampling, using a Gaussian process as a surrogate model, to approach the multi-agent Bayesian op…

Bayesian OptimizationThompson Sampling

Thompson Sampling for Online Learning with Linear Experts

2013-11-03 · Aditya Gopalan

In this note, we present a version of the Thompson sampling algorithm for the problem of online linear generalization with full information (i.e., the experts setting), studied by Kalai and Vempala, 2005. The algorithm u…

Thompson Sampling

Fast Online Learning with Gaussian Prior-Driven Hierarchical Unimodal Thompson Sampling

2026-02-17 · Tianchi Zhao, He Liu, Hongyin Shi, Jinliang Li arxiv

We study a type of Multi-Armed Bandit (MAB) problems in which arms with a Gaussian reward feedback are clustered. Such an arm setting finds applications in many real-world problems, for example, mmWave communications and…