DeepAI AI Chat
Log In Sign Up

Matrix Completion from Quantized Samples via Generalized Sparse Bayesian Learning

by   Jiang Zhu, et al.
Zhejiang University

The recovery of a low rank matrix from a subset of noisy low-precision quantized samples arises in several applications such as collaborative filtering, intelligent recommendation and millimeter wave channel estimation with few bit ADCs. In this paper, a generalized sparse Bayesian learning (Gr-SBL) combining expectation propagation (EP) is proposed to solve the matrix completion (MC), which is termed as MC-Gr-SBL. The MC-Gr-SBL automatically estimates the rank, the factors and their covariance matrices, and the noise variance. In addition, MC-Gr-SBL is proposed to solve the two dimensional line spectral estimation problem by incorporating the MUSIC algorithm. Finally, substantial numerical experiments are conducted to verify the effectiveness of the proposed algorithm.


page 1

page 2

page 3

page 4


Clipped Matrix Completion: a Remedy for Ceiling Effects

We consider the recovery of a low-rank matrix from its clipped observati...

Optimal tuning-free convex relaxation for noisy matrix completion

This paper is concerned with noisy matrix completion–the problem of reco...

Bayesian Matrix Completion via Adaptive Relaxed Spectral Regularization

Bayesian matrix completion has been studied based on a low-rank matrix f...

Off-grid Variational Bayesian Inference of Line Spectral Estimation from One-bit Samples

In this paper, the line spectral estimation (LSE) problem is studied fro...

Matrix Completion of World Trade

This work applies Matrix Completion (MC) – a class of machine-learning m...

Transduction with Matrix Completion Using Smoothed Rank Function

In this paper, we propose two new algorithms for transduction with Matri...

AIR-Net: Adaptive and Implicit Regularization Neural Network for Matrix Completion

Conventionally, the matrix completion (MC) model aims to recover a matri...