Bayesian site selection for fast Gaussian process regression

Arash Pourhabib, Faming Liang, Yu Ding

Research output: Contribution to journalArticlepeer-review

9 Scopus citations


Gaussian Process (GP) regression is a popular method in the field of machine learning and computer experiment designs; however, its ability to handle large data sets is hindered by the computational difficulty in inverting a large covariance matrix. Likelihood approximation methods were developed as a fast GP approximation, thereby reducing the computation cost of GP regression by utilizing a much smaller set of unobserved latent variables called pseudo points. This article reports a further improvement to the likelihood approximation methods by simultaneously deciding both the number and locations of the pseudo points. The proposed approach is a Bayesian site selection method where both the number and locations of the pseudo inputs are parameters in the model, and the Bayesian model is solved using a reversible jump Markov chain Monte Carlo technique. Through a number of simulated and real data sets, it is demonstrated that with appropriate priors chosen, the Bayesian site selection method can produce a good balance between computation time and prediction accuracy: it is fast enough to handle large data sets that a full GP is unable to handle, and it improves, quite often remarkably, the prediction accuracy, compared with the existing likelihood approximations. © 2014 Taylor and Francis Group, LLC.
Original languageEnglish (US)
Pages (from-to)543-555
Number of pages13
JournalIIE Transactions
Issue number5
StatePublished - Feb 5 2014
Externally publishedYes


Dive into the research topics of 'Bayesian site selection for fast Gaussian process regression'. Together they form a unique fingerprint.

Cite this