A Riemannian gossip approach to decentralized matrix completion - implementation -

 

 

 

Bamdev just sent me the following:

Dear Igor,

I also wish to share our recent technical report on "a Riemannian gossip approach to decentralized matrix completion". I hope, this connects well to your interest in collecting algorithms for matrix completion/factorization.

The paper is at https://arxiv.org/abs/1605.06968. The codes are available at https://bamdevmishra.com/codes/gossipmc/.

Regards,
Bamdev

Thanks Bamdev .

A Riemannian gossip approach to decentralized matrix completion by Bamdev Mishra, Hiroyuki Kasai, Atul Saroop

In this paper, we propose novel gossip algorithms for the low-rank decentralized matrix completion problem. The proposed approach is on the Riemannian Grassmann manifold that allows local matrix completion by different agents while achieving asymptotic consensus on the global low-rank factors. The resulting approach is scalable and parallelizable. Our numerical experiments show the good performance of the proposed algorithms on various benchmarks.

 
 
 
 
 
 

Join the CompressiveSensing subreddit or the Google+ Community or the Facebook page and post there !
Liked this entry ? subscribe to Nuit Blanche's feed, there's more where that came from. You can also subscribe to Nuit Blanche by Email, explore the Big Picture in Compressive Sensing or the Matrix Factorization Jungle and join the conversations on compressive sensing, advanced matrix factorization and calibration issues on Linkedin.