Constructing Bayesian formulations of sparse kernel learning methods

doi:10.1016/j.neunet.2005.06.002

Constructing Bayesian formulations of sparse kernel learning methods

2005-07-01

5

PRE

AI

DOI：10.1016/j.neunet.2005.06.002

Original

Original request for help

Save

Abstract

En 中文

We present here a simple technique that simplifies the construction of Bayesian treatments of a variety of sparse kernel learning algorithms. An incomplete Cholesky factorisation is employed to modify the dual parameter space, such that the Gaussian prior over the dual model parameters is whitened. The regularisation term then corresponds to the usual weight-decay regulariser, allowing the Bayesian analysis to proceed via the evidence framework of MacKay. There is in addition a useful by-product associated with the incomplete Cholesky factorisation algorithm, it also identifies a subset of the training data forming an approximate basis for the entire dataset in the kernel-induced feature space, resulting in a sparse model. Bayesian treatments of the kernel ridge regression (KRR) algorithm, with both constant and heteroscedastic (input dependent) variance structures, and kernel logistic regression (KLR) are provided as illustrative examples of the proposed method, which we hope will be more widely applicable. (c) 2005 Elsevier Ltd. All rights reserved.

Keywords:

FRAMEWORK

REGRESSION

Constructing Bayesian formulations of sparse kernel learning methods

Abstract

AI Summary

Journal

Organization