Conference item icon

Conference item

Time-varying Gaussian process bandits with unknown prior

Abstract:
Bayesian optimisation requires fitting a Gaussian process model, which in turn requires specifying prior on the unknown black-box function—most of the theoretical literature assumes this prior is known. However, it is common to have more than one possible prior for a given black-box function, for example suggested by domain experts with differing opinions. In some cases, the type-II maximum likelihood estimator for selecting prior enjoys the consistency guarantee, but it does not universally apply to all types of priors. If the problem is stationary, one could rely on the Regret Balancing scheme to conduct the optimisation, but in the case of time-varying problems, such a scheme cannot be used. To address this gap in existing research, we propose a novel algorithm, PE-GP-UCB, which is capable of solving time-varying Bayesian optimisation problems even without the exact knowledge of the function’s prior. The algorithm relies on the fact that either the observed function values are consistent with some of the priors, in which case it is easy to reject the wrong priors, or the observations are consistent with all candidate priors, in which case it does not matter which prior our model relies on. We provide a regret bound on the proposed algorithm. Finally, we empirically evaluate our algorithm on toy and real-world time-varying problems and show that it outperforms the maximum likelihood estimator, fully Bayesian treatment of unknown prior and Regret Balancing.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Publication website:
https://proceedings.mlr.press/v258/ziomek25a.html

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Oxford college:
St Catherine's; St Catherine's College
Role:
Author
ORCID:
0000-0003-2580-2280
More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Engineering Science
Role:
Author
ORCID:
0000-0003-1959-012X


Publisher:
PMLR
Host title:
Proceedings of The 28th International Conference on Artificial Intelligence and Statistics
Pages:
4294-4302
Series:
Proceedings of Machine Learning Research
Series number:
258
Publication date:
2025-05-22
Acceptance date:
2025-01-21
Event title:
28th International Conference on Artificial Intelligence and Statistics (AISTATS)
Event location:
Splash Beach Resort in Mai Khao, Thailand
Event website:
https://proceedings.mlr.press/v258/ziomek25a.html
Event start date:
2025-05-03
Event end date:
2025-05-05
ISSN:
2640-3498


Language:
English
Pubs id:
2131114
Local pid:
pubs:2131114
Deposit date:
2025-06-21

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP