Sequential Bayesian Kernel Regression

We propose a method for sequential Bayesian kernel regression. As is the case for the popular Relevance Vector Machine (RVM) [10, 11], the method automatically identifies the number and locations of the kernels. Our algorithm overcomes some of the computational difficulties related to batch methods for kernel regression. It is non-iterative, and requires only a single pass over the data. It is thus applicable to truly sequential data sets and batch data sets alike. The algorithm is based on a generalisation of Importance Sampling, which allows the design of intuitively simple and efficient proposal distributions for the model parameters. Comparative results on two standard data sets show our algorithm to compare favourably with existing batch estimation strategies.

• Type: Conference
• Year: 2003
• Where: NIPS
• Authors: Jaco Vermaak, Simon J. Godsill, Arnaud Doucet
• Keywords: Data Sets, Kernel Regression, NIPS 2003, NIPS 2007, Sequential Bayesian Kernel