We study the problem of reconstructing low-rank matrices from their noisy observations. We formulate the problem in the Bayesian framework, which allows us to exploit structural properties of matrices in addition to low-rankedness, such as sparsity. We propose an efficient approximate message passing algorithm, derived from the belief propagation algorithm, to perform the Bayesian inference for matrix reconstruction. We have also successfully applied the proposed algorithm to a clustering problem, by formulating the problem of clustering as a low-rank matrix reconstruction problem with an additional structural property. Numerical experiments show that the proposed algorithm outperforms Lloyd's K-means algorithm.
Ryosuke Matsushita (NTT DATA Mathematical Systems Inc.)
Toshiyuki Tanaka (Kyoto University)
More from the Same Authors
2019 Poster: Spatially Aggregated Gaussian Processes with Multivariate Areal Outputs »
Yusuke Tanaka · Toshiyuki Tanaka · Tomoharu Iwata · Takeshi Kurashima · Maya Okawa · Yasunori Akagi · Hiroyuki Toda