Variational Bayesian sparse additive matrix factorization

doi:10.1007/s10994-013-5347-6

Variational Bayesian sparse additive matrix factorization

2013-05-04

13

OA

AI

DOI：10.1007/s10994-013-5347-6

Original

Original request for help

Save

Abstract

En 中文

Principal component analysis (PCA) approximates a data matrix with a low-rank one by imposing sparsity on its singular values. Its robust variant can cope with spiky noise by introducing an element-wise sparse term. In this paper, we extend such sparse matrix learning methods, and propose a novel framework called sparse additive matrix factorization (SAMF). SAMF systematically induces various types of sparsity by a Bayesian regularization effect, called model-induced regularization. Although group LASSO also allows us to design arbitrary types of sparsity on a matrix, SAMF, which is based on the Bayesian framework, provides inference without any requirement for manual parameter tuning. We propose an efficient iterative algorithm called the mean update (MU) for the variational Bayesian approximation to SAMF, which gives the global optimal solution for a large subset of parameters in each step. We demonstrate the usefulness of our method on benchmark datasets and a foreground/background video separation problem.

Keywords:

Variational Bayes

Robust PCA

Matrix factorization

Sparsity

Model-induced regularization

Variational Bayesian sparse additive matrix factorization

Abstract

Journal

Organization