Fast Bayesian Inference for Non-Conjugate Gaussian Process Regression
Abstract
We present a new variational inference algorithm for Gaussian processes with non-conjugate likelihood functions. This includes binary and multi-class classification, as well as ordinal regression. Our method constructs a convex lower bound, which can be optimized by using an efficient fixed point update method. We then show empirically that our new approach is much faster than existing methods without any degradation in performance.
Cite
Text
Khan et al. "Fast Bayesian Inference for Non-Conjugate Gaussian Process Regression." Neural Information Processing Systems, 2012.Markdown
[Khan et al. "Fast Bayesian Inference for Non-Conjugate Gaussian Process Regression." Neural Information Processing Systems, 2012.](https://mlanthology.org/neurips/2012/khan2012neurips-fast/)BibTeX
@inproceedings{khan2012neurips-fast,
title = {{Fast Bayesian Inference for Non-Conjugate Gaussian Process Regression}},
author = {Khan, Mohammad Emtiyaz and Mohamed, Shakir and Murphy, Kevin P.},
booktitle = {Neural Information Processing Systems},
year = {2012},
pages = {3140-3148},
url = {https://mlanthology.org/neurips/2012/khan2012neurips-fast/}
}