Fast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models

Abstract

The problem of low rank matrix completion is considered in this paper. To exploit the underlying low-rank structure of the data matrix, we propose a hierarchical Gaussian prior model, where columns of the low-rank matrix are assumed to follow a Gaussian distribution with zero mean and a common precision matrix, and a Wishart distribution is specified as a hyperprior over the precision matrix. We show that such a hierarchical Gaussian prior has the potential to encourage a low-rank solution. Based on the proposed hierarchical prior model, a variational Bayesian method is developed for matrix completion, where the generalized approximate massage passing (GAMP) technique is embedded into the variational Bayesian inference in order to circumvent cumbersome matrix inverse operations. Simulation results show that our proposed method demonstrates superiority over existing state-of-the-art matrix completion methods.

References in corpus (4)

• Multi-View Matrix Completion for Multi-Label Image Classification
• Robust Volume Minimization-Based Matrix Factorization for Remote Sensing and Document Clustering
• Joint Tensor Factorization and Outlying Slab Suppression with Applications
• LogDet Rank Minimization with Application to Subspace Clustering

Cited by in corpus (15)

• Bayesian Low Rank Tensor Ring Model for Image Completion
• Deep Learning Methods for Solving Linear Inverse Problems: Research Directions and Paradigms
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach
• Exponential weights in multivariate regression and a low-rankness favoring prior
• A reduced-rank approach to predicting multiple binary responses through machine learning
• From bilinear regression to inductive matrix completion: a quasi-Bayesian analysis
• Concentration properties of fractional posterior in 1-bit matrix completion
• Sparse Bayesian Learning Approach for Discrete Signal Reconstruction
• Efficient Bayesian reduced rank regression using Langevin Monte Carlo approach
• Matrix Completion from Quantized Samples via Generalized Sparse Bayesian Learning
• Generalized infinite factorization models
• Variational Bayesian inference for CP tensor completion with side information
• Online Variational Bayesian Subspace Filtering with Applications
• Simulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion
• The Sparse Reverse of Principal Component Analysis for Fast Low-Rank Matrix Completion