Bayesian methods for low-rank matrix estimation: short survey and theoretical study
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.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Sparse Bayesian Methods for Low-Rank Matrix Estimation
Recovery of low-rank matrices has recently seen significant activity in many areas of science and engineering, motivated by recent theoretical results for exact reconstruction guarantees and interesting practical applica…
Matrix CompletionSimulation comparisons between Bayesian and de-biased estimators in low-rank matrix completion
In this paper, we study the low-rank matrix completion problem, a class of machine learning problems, that aims at the prediction of missing entries in a partially observed matrix. Such problems appear in several challen…
Collaborative FilteringImputationLow-Rank Matrix CompletionMatrix CompletionRevisiting clustering as matrix factorisation on the Stiefel manifold
This paper studies clustering for possibly high dimensional data (e.g. images, time series, gene expression data, and many other settings), and rephrase it as low rank matrix estimation in the PAC-Bayesian framework. Our…
ClusteringTime SeriesTime Series AnalysisFast Low-Rank Bayesian Matrix Completion with Hierarchical Gaussian Prior Models
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…
Bayesian InferenceLow-Rank Matrix CompletionMatrix CompletionFast Non-Bayesian Poisson Factorization for Implicit-Feedback Recommendations
This work explores non-negative low-rank matrix factorization based on regularized Poisson models (PF or "Poisson factorization" for short) for recommender systems with implicit-feedback data. The properties of Poisson l…
Recommendation SystemsVariational Inference