Differentiating Policies for Non-Myopic Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
Bayesian optimization (BO) methods choose sample points by optimizing an acquisition function derived from a statistical model of the objective. These acquisition functions are chosen to balance sampling regions with predicted good objective values against exploring regions where the objective is uncertain. Standard acquisition functions are myopic, considering only the impact of the next sample, but non-myopic acquisition functions may be more effective. In principle, one could model the sampling by a Markov decision process, and optimally choose the next sample by maximizing an expected reward computed by dynamic programming; however, this is infeasibly expensive. More practical approaches, such as rollout, consider a parametric family of sampling policies. In this paper, we show how to efficiently estimate rollout acquisition functions and their gradients, enabling stochastic gradient-based optimization of sampling policies.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 6 of its 28 references that are in the map. First posted on arXiv 14 Aug 2024.
Builds on
6 of 28 references.
References · 6
- 2018A Tutorial on Bayesian Optimizationcited by 734
- 2020Efficient Nonmyopic Bayesian Optimization via One-Shot Multi-Step Treescited by 41
- 2017Early Stopping without a Validation Setcited by 39
- 2015GLASSES: Relieving The Myopia Of Bayesian Optimisationcited by 38
- 2020Efficient Rollout Strategies for Bayesian Optimizationcited by 19
- 2015Gaussian Process Planning with Lipschitz Continuous Reward Functions: Towards Unifying Bayesian Optimization, Active Learning, and Beyondcited by 15
Built on by
Citing papers per year: 2026: 1.
1 paper.