Approximate Method of Variational Bayesian Matrix Factorization/Completion with Sparse Prior

03/14/2018
by   Ryota Kawasumi, et al.
0

We derive analytical expression of matrix factorization/completion solution by variational Bayes method, under the assumption that observed matrix is originally the product of low-rank dense and sparse matrices with additive noise. We assume the prior of sparse matrix is Laplace distribution by taking matrix sparsity into consideration. Then we use several approximations for derivation of matrix factorization/completion solution. By our solution, we also numerically evaluate the performance of sparse matrix reconstruction in matrix factorization, and completion of missing matrix element in matrix completion.

READ FULL TEXT
research
05/17/2023

Automatic Hyperparameter Tuning in Sparse Matrix Factorization

We study the problem of hyperparameter tuning in sparse matrix factoriza...
research
10/09/2014

Matrix Completion and Low-Rank SVD via Fast Alternating Least Squares

The matrix-completion problem has attracted a lot of attention, largely ...
research
02/20/2018

Empirical Bayes Matrix Factorization

Matrix factorization methods - including Factor analysis (FA), and Princ...
research
12/31/2014

ACCAMS: Additive Co-Clustering to Approximate Matrices Succinctly

Matrix completion and approximation are popular tools to capture a user'...
research
06/29/2019

Approximate matrix completion based on cavity method

In order to solve large matrix completion problems with practical comput...
research
02/20/2019

Active Matrix Factorization for Surveys

Amid historically low response rates, survey researchers seek ways to re...
research
05/30/2019

Matrix Completion in the Unit Hypercube via Structured Matrix Factorization

Several complex tasks that arise in organizations can be simplified by m...

Please sign up or login with your details

Forgot password? Click here to reset