ROBUST RVM BASED ON SPIKE-SLAB PRIOR
Although Relevance Vector Machine (RVM) is the most popular algorithms in machine learning and computer vision, outliers in the training data make the estimation unreliable. In the paper, a robust RVM model under non-parametric Bayesian framework is proposed. We decompose the noise term in the RVM m...
Saved in:
Published in | Journal of electronics (China) Vol. 29; no. 6; pp. 593 - 597 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Heidelberg
SP Science Press
2012
School of Information Science and Technology, Xiamen University, Xiamen 361005, China |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Although Relevance Vector Machine (RVM) is the most popular algorithms in machine learning and computer vision, outliers in the training data make the estimation unreliable. In the paper, a robust RVM model under non-parametric Bayesian framework is proposed. We decompose the noise term in the RVM model into two components, a Gaussian noise term and a spiky noise term. Therefore the observed data is assumed represented as: y=Dw+s+e, where Dw is the relevance vector component, of which D is the kernel function matrix and w is the weight matrix, s is the spiky term and e is the Gaussian noise term. A spike-slab sparse prior is imposed on the weight vector w, which gives a more intuitive constraint on the sparsity than the Student's t-distribution described in the traditional RVM. For the spiky component s, a spike-slab sparse prior is also introduced to recognize outliers in the training data effectively. Several experiments demonstrate the better per- formance over the RVM regression. |
---|---|
Bibliography: | Relevance Vector Machine (RVM); Bayesian nonparametric; Outliers; Spike-slab sparseprior 11-2003/TN Although Relevance Vector Machine (RVM) is the most popular algorithms in machine learning and computer vision, outliers in the training data make the estimation unreliable. In the paper, a robust RVM model under non-parametric Bayesian framework is proposed. We decompose the noise term in the RVM model into two components, a Gaussian noise term and a spiky noise term. Therefore the observed data is assumed represented as: y=Dw+s+e, where Dw is the relevance vector component, of which D is the kernel function matrix and w is the weight matrix, s is the spiky term and e is the Gaussian noise term. A spike-slab sparse prior is imposed on the weight vector w, which gives a more intuitive constraint on the sparsity than the Student's t-distribution described in the traditional RVM. For the spiky component s, a spike-slab sparse prior is also introduced to recognize outliers in the training data effectively. Several experiments demonstrate the better per- formance over the RVM regression. |
ISSN: | 0217-9822 1993-0615 |
DOI: | 10.1007/s11767-012-0873-0 |