Using transformed domains to sparsify Gaussian Processes
- đ¤ Speaker: Speaker to be confirmed
- đ Date & Time: Tuesday 13 July 2010, 14:00 - 15:00
- đ Venue: Small public lecture room, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
Abstract
Abstract: One of the main limitations associated to the use of Gaussian Processes (GPs) to model data is their high computational cost, which is O(n^3) for n training samples. In this talk, I will discuss several recently proposed GP models that rely on the use of a `transformed domain` to achieve sparsity and make computation for large data sets affordable. These proposals are comparable in terms of computational cost to previous approaches, such as the celebrated Sparse Pseudo-Input GP (also known as FITC ), but typically offer superior performance. In particular, I will present the Sparse Spectrum GP (SSGP) as a very fast tool to model stationary processes and the Inter-Domain GP (IDGP) as a general framework for inference that can be used both to understand previous sparse GP models and to design new ones. A variational extension of the latter framework that rigorously addresses the overfilling problem will also be discussed.
Series This talk is part of the Microsoft Research Cambridge, public talks series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge Centre for Data-Driven Discovery (C2D3)
- Cambridge talks
- Chris Davis' list
- Guy Emerson's list
- Interested Talks
- Microsoft Research Cambridge, public talks
- ndk22's list
- ob366-ai4er
- Optics for the Cloud
- personal list
- PMRFPS's
- rp587
- School of Technology
- Small public lecture room, Microsoft Research Ltd, 7 J J Thomson Avenue (Off Madingley Road), Cambridge
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

Speaker to be confirmed
Tuesday 13 July 2010, 14:00-15:00