English

Kernel Bayesian Inference with Posterior Regularization

Machine Learning 2016-10-27 v2

Abstract

We propose a vector-valued regression problem whose solution is equivalent to the reproducing kernel Hilbert space (RKHS) embedding of the Bayesian posterior distribution. This equivalence provides a new understanding of kernel Bayesian inference. Moreover, the optimization problem induces a new regularization for the posterior embedding estimator, which is faster and has comparable performance to the squared regularization in kernel Bayes' rule. This regularization coincides with a former thresholding approach used in kernel POMDPs whose consistency remains to be established. Our theoretical work solves this open problem and provides consistency analysis in regression settings. Based on our optimizational formulation, we propose a flexible Bayesian posterior regularization framework which for the first time enables us to put regularization at the distribution level. We apply this method to nonparametric state-space filtering tasks with extremely nonlinear dynamics and show performance gains over all other baselines.

Keywords

Cite

@article{arxiv.1607.02011,
  title  = {Kernel Bayesian Inference with Posterior Regularization},
  author = {Yang Song and Jun Zhu and Yong Ren},
  journal= {arXiv preprint arXiv:1607.02011},
  year   = {2016}
}

Comments

NIPS 2016

R2 v1 2026-06-22T14:48:14.572Z