mlsanityData to 14 Oct 2026

Gaussian Process Thompson Sampling via Rootfinding

arXiv 2410.08071 ↗First posted 10 Oct 2024cs.LG math.OC stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 17 references that are in the map. First posted on arXiv 10 Oct 2024.

Builds on

8 of 17 references.

References · 8

  1. 2013Learning to Optimize Via Posterior Samplingcited by 256
  2. 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 206
  3. 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 204
  4. 2020Efficiently Sampling Functions from Gaussian Process Posteriorscited by 127
  5. 2018Maximizing acquisition functions for Bayesian optimizationcited by 114
  6. 2014Hilbert Space Methods for Reduced-Rank Gaussian Process Regressioncited by 88
  7. 2017Parallel and Distributed Thompson Sampling for Large-scale Accelerated Exploration of Chemical Spacecited by 76
  8. 2015Parallel Predictive Entropy Search for Batch Global Optimization of Expensive Objective Functionscited by 31

Built on by

Cited by year

Citing papers per year: 2024: 1; 2025: 1.

2 papers.