Paper abstract bibtex

In this paper we introduce deep Gaussian process (GP) models. Deep GPs are a deep belief network based on Gaussian process mappings. The data is modeled as the output of a multivariate GP. The inputs to that Gaussian process are then governed by another GP. A single layer model is equivalent to a standard GP or the GP latent variable model (GP-LVM). We perform inference in the model by approximate variational marginalization. This results in a strict lower bound on the marginal likelihood of the model which we use for model selection (number of layers and nodes per layer). Deep belief networks are typically applied to relatively large data sets using stochastic gradient descent for optimization. Our fully Bayesian treatment allows for the application of deep models even when data is scarce. Model selection by our variational bound shows that a five layer hierarchy is justified even when modelling a digit data set containing only 150 examples.

@article{damianouDeepGaussianProcesses2012, archivePrefix = {arXiv}, eprinttype = {arxiv}, eprint = {1211.0358}, primaryClass = {cs, math, stat}, title = {Deep {{Gaussian Processes}}}, url = {http://arxiv.org/abs/1211.0358}, abstract = {In this paper we introduce deep Gaussian process (GP) models. Deep GPs are a deep belief network based on Gaussian process mappings. The data is modeled as the output of a multivariate GP. The inputs to that Gaussian process are then governed by another GP. A single layer model is equivalent to a standard GP or the GP latent variable model (GP-LVM). We perform inference in the model by approximate variational marginalization. This results in a strict lower bound on the marginal likelihood of the model which we use for model selection (number of layers and nodes per layer). Deep belief networks are typically applied to relatively large data sets using stochastic gradient descent for optimization. Our fully Bayesian treatment allows for the application of deep models even when data is scarce. Model selection by our variational bound shows that a five layer hierarchy is justified even when modelling a digit data set containing only 150 examples.}, urldate = {2019-04-04}, date = {2012-11-01}, keywords = {Statistics - Machine Learning,Mathematics - Probability,Computer Science - Machine Learning,I.2.6,60G15; 58E30,G.1.2,G.3}, author = {Damianou, Andreas C. and Lawrence, Neil D.}, file = {/home/dimitri/Nextcloud/Zotero/storage/FCZ2J52I/Damianou and Lawrence - 2012 - Deep Gaussian Processes.pdf;/home/dimitri/Nextcloud/Zotero/storage/EPABC27J/1211.html} }

Downloads: 0