Advertisement

Constructive Approximation

, Volume 26, Issue 2, pp 205–224 | Cite as

Approximate Maximum a Posteriori with Gaussian Process Priors

  • Markus Hegland
Article

Abstract

A maximum a posteriori method has been developed for Gaussian priors over infinite-dimensional function spaces. In particular, variational equations based on a generalisation of the representer theorem and an equivalent optimisation problem are presented. This amounts to a generalisation of the ordinary Bayesian maximum a posteriori approach which is nontrivial as infinite-dimensional domains do not admit any probability densities. Instead of the gradient of the density, the logarithmic gradient of the probability distribution is used. Galerkin methods are proposed for the approximate solution of the variational equations. In summary, a framework and some foundations are provided which are required for the application of numerical approximation to an important class of machine learning problems.

Keywords

Exponential Family Gaussian Measure Reproduce Kernel Hilbert Space Sparse Grid Gaussian Process Regression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer 2007

Authors and Affiliations

  • Markus Hegland
    • 1
  1. 1.Statistical Machine Learning Group, NICTA and Centre for Mathematics and its Applications, Australian National UniversityCanberra, ACT 0200Australia

Personalised recommendations