Optimally-Weighted Herding is Bayesian Quadrature
Abstract
Herding and kernel herding are deterministic methods of choosing samples which summarise a probability distribution. A related task is choosing samples for estimating integrals using Bayesian quadrature. We show that the criterion minimised when selecting samples in kernel herding is equivalent to the posterior variance in Bayesian quadrature. We then show that sequential Bayesian quadrature can be viewed as a weighted version of kernel herding which achieves performance superior to any other weighted herding method. We demonstrate empirically a rate of convergence faster than O(1/N). Our results also imply an upper bound on the empirical error of the Bayesian quadrature estimate.
Cite
@article{arxiv.1204.1664,
title = {Optimally-Weighted Herding is Bayesian Quadrature},
author = {Ferenc Huszár and David Duvenaud},
journal= {arXiv preprint arXiv:1204.1664},
year = {2016}
}
Comments
Accepted as an oral presentation at Uncertainty in Artificial Intelligence 2012. Updated to fix several typos