The Bayesian backfitting relevance vector machine


Traditional non-parametric statistical learning techniques are often computationally attractive, but lack the same generalization and model selection abilities as state-of-the-art Bayesian algorithms which, however, are usually computationally prohibitive. This paper makes several important contributions that allow Bayesian learning to scale to more complex, real-world learning scenarios. Firstly, we show that <i>backfitting</i> --- a traditional non-parametric, yet highly efficient regression tool --- can be derived in a novel formulation within an expectation maximization (EM) framework and thus can finally be given a probabilistic interpretation. Secondly, we show that the general framework of <i>sparse Bayesian learning</i> and in particular the relevance vector machine (RVM), can be derived as a highly efficient algorithm using a Bayesian version of backfitting at its core. As we demonstrate on several regression and classification benchmarks, Bayesian backfitting offers a compelling alternative to current regression methods, especially when the size and dimensionality of the data challenge computational resources.

DOI: 10.1145/1015330.1015358

Extracted Key Phrases

7 Figures and Tables

Cite this paper

@inproceedings{DSouza2004TheBB, title={The Bayesian backfitting relevance vector machine}, author={Aaron R D'Souza and Sethu Vijayakumar and Stefan Schaal}, booktitle={ICML}, year={2004} }