Bayesian Learning for Low-Rank matrix reconstruction

01/23/2015
by   Martin Sundin, et al.
0

We develop latent variable models for Bayesian learning based low-rank matrix completion and reconstruction from linear measurements. For under-determined systems, the developed methods are shown to reconstruct low-rank matrices when neither the rank nor the noise power is known a-priori. We derive relations between the latent variable models and several low-rank promoting penalty functions. The relations justify the use of Kronecker structured covariance matrices in a Gaussian based prior. In the methods, we use evidence approximation and expectation-maximization to learn the model parameters. The performance of the methods is evaluated through extensive numerical simulations.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/21/2017

Nice latent variable models have log-rank

Matrices of low rank are pervasive in big data, appearing in recommender...
research
08/08/2017

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

The problem of low rank matrix completion is considered in this paper. T...
research
04/25/2020

Low-rank multi-parametric covariance identification

We propose a differential geometric construction for families of low-ran...
research
09/23/2020

Learning Mixtures of Low-Rank Models

We study the problem of learning mixtures of low-rank models, i.e. recon...
research
10/20/2021

Reconstruction of Fragmented Trajectories of Collective Motion using Hadamard Deep Autoencoders

Learning dynamics of collectively moving agents such as fish or humans i...
research
06/02/2023

Robust low-rank training via approximate orthonormal constraints

With the growth of model and data sizes, a broad effort has been made to...
research
10/27/2021

Poisson PCA for matrix count data

We develop a dimension reduction framework for data consisting of matric...

Please sign up or login with your details

Forgot password? Click here to reset