Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior
© 2018 Curran Associates Inc.All rights reserved. Bayesian optimization usually assumes that a Bayesian prior is given. However, the strong theoretical guarantees in Bayesian optimization are often regrettably compromised in practice because of unknown parameters in the prior. In this paper, we adop...
Main Authors: | Kaelbling, Leslie P., Kim, Beomjoon, Wang, Zi |
---|---|
Format: | Article |
Language: | English |
Published: |
2021
|
Online Access: | https://hdl.handle.net/1721.1/137709 |
Similar Items
-
Regret bounds for meta Bayesian optimization with an unknown Gaussian process prior
by: Kaelbling, Leslie P., et al.
Published: (2022) -
Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds
by: Kim, Beomjoon, et al.
Published: (2021) -
Monte Carlo Tree Search in Continuous Spaces Using Voronoi Optimistic Optimization with Regret Bounds
by: Kim, Beomjoon, et al.
Published: (2022) -
Exponential Regret Bounds for Gaussian Process Bandits with Deterministic Observations
by: de Freitas, N, et al.
Published: (2012) -
Collaborative Bayesian Optimization with Fair Regret
by: Sim, Rachael Hwee Ling, et al.
Published: (2022)