Empirical Bayes Matrix Completion

06/05/2017
by   Takeru Matsuda, et al.
0

We develop an empirical Bayes (EB) algorithm for the matrix completion problems. The EB algorithm is motivated from the singular value shrinkage estimator for matrix means by Efron and Morris (1972). Since the EB algorithm is essentially the EM algorithm applied to a simple model, it does not require heuristic parameter tuning other than tolerance. Numerical results demonstrated that the EB algorithm achieves a good trade-off between accuracy and efficiency compared to existing algorithms and that it works particularly well when the difference between the number of rows and columns is large. Application to real data also shows the practical utility of the EB algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/16/2018

Faster Matrix Completion Using Randomized SVD

Matrix completion is a widely used technique for image inpainting and pe...
research
12/02/2019

A Fast Matrix-Completion-Based Approach for Recommendation Systems

Matrix completion is widely used in machine learning, engineering contro...
research
12/03/2020

Matrix Completion Methods for the Total Electron Content Video Reconstruction

The total electron content (TEC) maps can be used to estimate the signal...
research
09/02/2020

Clustering of Nonnegative Data and an Application to Matrix Completion

In this paper, we propose a simple algorithm to cluster nonnegative data...
research
11/09/2012

Calibrated Elastic Regularization in Matrix Completion

This paper concerns the problem of matrix completion, which is to estima...
research
03/15/2022

Lifelong Matrix Completion with Sparsity-Number

Matrix completion problem has been previously studied under various adap...
research
09/09/2022

Optimal (0,1)-Matrix Completion with Majorization Ordered Objectives (To the memory of Pravin Varaiya)

We propose and examine two optimal (0,1)-matrix completion problems with...

Please sign up or login with your details

Forgot password? Click here to reset