Bayesian methods for low-rank matrix estimation: short survey and theoretical study

06/17/2013
by   Pierre Alquier, et al.
0

The problem of low-rank matrix estimation recently received a lot of attention due to challenging applications. A lot of work has been done on rank-penalized methods and convex relaxation, both on the theoretical and applied sides. However, only a few papers considered Bayesian estimation. In this paper, we review the different type of priors considered on matrices to favour low-rank. We also prove that the obtained Bayesian estimators, under suitable assumptions, enjoys the same optimality properties as the ones based on penalization.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2022

On a low-rank matrix single index model

In this paper, we present a theoretical study of a low-rank matrix singl...
research
08/11/2022

Low-rank Matrix Estimation with Inhomogeneous Noise

We study low-rank matrix estimation for a generic inhomogeneous output c...
research
03/07/2021

Euclidean Representation of Low-Rank Matrices and Its Statistical Applications

Low-rank matrices are pervasive throughout statistics, machine learning,...
research
03/11/2019

Revisiting clustering as matrix factorisation on the Stiefel manifold

This paper studies clustering for possibly high dimensional data (e.g. i...
research
11/30/2022

Robust and Fast Measure of Information via Low-rank Representation

The matrix-based Rényi's entropy allows us to directly quantify informat...
research
03/22/2021

Numerical comparisons between Bayesian and frequentist low-rank matrix completion: estimation accuracy and uncertainty quantification

In this paper we perform a numerious numerical studies for the problem o...
research
09/26/2021

Sparse Plus Low Rank Matrix Decomposition: A Discrete Optimization Approach

We study the Sparse Plus Low Rank decomposition problem (SLR), which is ...

Please sign up or login with your details

Forgot password? Click here to reset