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

From MaRDI portal
Publication:2859226

DOI10.1007/978-3-642-40935-6_22zbMATH Open1411.62136arXiv1306.3862OpenAlexW3104280185MaRDI QIDQ2859226FDOQ2859226


Authors: Pierre Alquier Edit this on Wikidata


Publication date: 6 November 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1306.3862




Recommendations





Cited In (17)





This page was built for publication: Bayesian methods for low-rank matrix estimation: short survey and theoretical study

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2859226)