Graduate Student / Postdoc Seminar
Fast Algorithms for Gaussian Processes
Speaker: Michael O'Neil
Location: Warren Weaver Hall 1302
Date: Friday, October 24, 2014, 1 p.m.
Gaussian processes are one class of stochastic process that provides a straight-forward generalization of random variables to random functions. These random functions are specified via a pointwise multivariate normal distribution whose variance structure is described using a covariance kernel. Although their use in mathematical statistics, machine learning, and data analysis for regression and classification problems has been ubiquitous, their computational cost has been dominated by dense linear algebra operations (inverses, applications, and determinants) which scale as O(n^2) or O(n^3), where n is the number of pointwise evaluations (or observed evaluations) of the random function. However, by drawing on many ideas central to fast multipole methods, it is possible to design schemes which scale as O(nlogn) or O(n) for many widely-used covariance kernels. In this talk, we will give a brief overview of Gaussian processes, their many applications, and demonstrate the performance of these fast schemes via several numerical examples.