Active Learning of Conditional Mean Embeddings via Bayesian Optimisation
Abstract
We consider the problem of sequentially optimising the conditional expectation of an objective function, with both the conditional distribution and the objective function assumed to be fixed but unknown. Assuming that the objective function belongs to a reproducing kernel Hilbert space (RKHS), we provide a novel upper confidence bound (UCB) based algorithm CME-UCB via estimation of the conditional mean embeddings (CME), and derive its regret bound. Along the way, we derive novel approximation guarantees for the CME estimates. Finally, experiments are carried out in a synthetic example and in a likelihood-free inference application that highlight the useful insights of the proposed method.
Cite
Text
Ray Chowdhury et al. "Active Learning of Conditional Mean Embeddings via Bayesian Optimisation." Uncertainty in Artificial Intelligence, 2020.Markdown
[Ray Chowdhury et al. "Active Learning of Conditional Mean Embeddings via Bayesian Optimisation." Uncertainty in Artificial Intelligence, 2020.](https://mlanthology.org/uai/2020/raychowdhury2020uai-active/)BibTeX
@inproceedings{raychowdhury2020uai-active,
title = {{Active Learning of Conditional Mean Embeddings via Bayesian Optimisation}},
author = {Ray Chowdhury, Sayak and Oliveira, Rafael and Ramos, Fabio},
booktitle = {Uncertainty in Artificial Intelligence},
year = {2020},
pages = {1119-1128},
volume = {124},
url = {https://mlanthology.org/uai/2020/raychowdhury2020uai-active/}
}