Proceedings of Machine Learning ResearchGaussian Processes in Practice
Held in Bletchley Park, UK on 12-13 June 2006
Published as Volume 1 by the Proceedings of Machine Learning Research on 11 March 2007.
Volume Edited by:
Neil D. Lawrence
Anton Schwaighofer
Joaquin QuiĆ±onero Candela
Series Editors:
Neil D. Lawrence
http://proceedings.mlr.press/v1/
Tue, 18 Aug 2020 12:50:56 +0000Tue, 18 Aug 2020 12:50:56 +0000Jekyll v3.9.0Sparse Log Gaussian Processes via MCMC for Spatial EpidemiologyLog Gaussian processes are an attractive manner to construct intensity surfaces for the purposes of spatial epidemiology. The intensity surfaces are naturally smoothed by placing a Gaussian process (GP) prior over the relative log Poisson rate, and the spatial correlations between areas can be included in an explicit and natural way into the model via a correlation function. The drawback with using a Gaussian process is the computational burden of the covariance matrix calculations. To overcome the computational limitations a number of approximations for Gaussian process have been suggested in the literature. In this work a fully independent training conditional sparse approximation is used to speed up the computations. The posterior inference is conducted using Markov chain Monte Carlo simulations and the sampling of the latent values is sped up by a transformation taking into account their posterior covariance. The sparse approximation is compared to a full GP with two sets of mortality data.Sun, 11 Mar 2007 00:00:00 +0000
http://proceedings.mlr.press/v1/vanhatalo07a.html
http://proceedings.mlr.press/v1/vanhatalo07a.htmlMulti-class Semi-supervised Learning with the $\epsilon$-truncated Multinomial Probit Gaussian ProcessRecently, the null category noise model has been proposed as a simple and elegant solution to the problem of incorporating unlabeled data into a Gaussian process (GP) classification model. In this paper, we show how this binary likelihood model can be generalised to the multi-class setting through the use of the multinomial probit GP classifier. We present a Gibbs sampling scheme for sampling the GP parameters and also derive a more efficient variational updating scheme. We find that the performance improvement is roughly consistent with that observed in binary classification and that there is no significant difference in classification performance between the Gibbs sampling and variational schemes.Sun, 11 Mar 2007 00:00:00 +0000
http://proceedings.mlr.press/v1/rogers07a.html
http://proceedings.mlr.press/v1/rogers07a.htmlSalient Point and Scale Detection by Minimum LikelihoodWe propose a novel approach for detection of salient image points and estimation of their intrinsic scales based on the fractional Brownian image model. Under this model images are realisations of a Gaussian random process on the plane. We define salient points as points that have a locally unique image structure. Such points are usually sparsely distributed in images and carry important information about the image content. Locality is defined in terms of the measurement scale of the filters used to describe the image structure. Here we use partial derivatives of the image function defined using linear scale space theory. We propose to detect salient points and their intrinsic scale by detecting points in scale-space that locally minimise the likelihood under the model.Sun, 11 Mar 2007 00:00:00 +0000
http://proceedings.mlr.press/v1/pedersen07a.html
http://proceedings.mlr.press/v1/pedersen07a.htmlLearning RoboCup-Keepaway with KernelsWe apply kernel-based methods to solve the difficult reinforcement learning problem of 3vs2 keepaway in RoboCup simulated soccer. Key challenges in keepaway are the highdimensionality of the state space (rendering conventional discretization-based function approximation like tilecoding infeasible), the stochasticity due to noise and multiple learning agents needing to cooperate (meaning that the exact dynamics of the environment are unknown) and real-time learning (meaning that an efficient online implementation is required). We employ the general framework of approximate policy iteration with least-squares-based policy evaluation. As underlying function approximator we consider the family of regularization networks with subset of regressors approximation. The core of our proposed solution is an efficient recursive implementation with automatic supervised selection of relevant basis functions. Simulation results indicate that the behavior learned through our approach clearly outperforms the best results obtained with tilecoding by Stone et al. (2005).Sun, 11 Mar 2007 00:00:00 +0000
http://proceedings.mlr.press/v1/jung07a.html
http://proceedings.mlr.press/v1/jung07a.htmlGaussian Process Approximations of Stochastic Differential EquationsStochastic differential equations arise naturally in a range of contexts, from financial to environmental modeling. Current solution methods are limited in their representation of the posterior process in the presence of data. In this work, we present a novel Gaussian process approximation to the posterior measure <em>over paths</em> for a general class of stochastic differential equations in the presence of observations. The method is applied to two simple problems: the Ornstein-Uhlenbeck process, of which the exact solution is known and can be compared to, and the double-well system, for which standard approaches such as the ensemble Kalman smoother fail to provide a satisfactory result. Experiments show that our variational approximation is viable and that the results are very promising as the variational approximate solution outperforms standard Gaussian process regression for non-Gaussian Markov processes.Sun, 11 Mar 2007 00:00:00 +0000
http://proceedings.mlr.press/v1/archambeau07a.html
http://proceedings.mlr.press/v1/archambeau07a.html