Jump to content

Relevance vector machine

From Wikipedia, the free encyclopedia

This is an old revision of this page, as edited by 84.12.111.19 (talk) at 11:59, 16 April 2008 (Noted that RVMs aren't guaranteed to find globally opimal solutions, unlike SVMs). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Relevance Vector Machine (RVMs) is a machine learning technique that uses Bayesian theory to obtain sparse solutions for regression and classification. The RVM has an identical functional form to the Support Vector Machine, but provides probabilistic classification.

Compared to the SVM the Bayesian formulation allows to avoid the set of free parameters that the SVM have and that usually require cross-validation based post optimizations. However RVMs use a gradient-ascent learning method and are therefore at risk of local minima, unlike the standard [SMO] based algorithms employed by [SVM]s which are guaranteed to find a global optimum.