IMP: A Message-Passing Algorithmfor Matrix Completion

R. G. Gallager, Low-Density Parity-Check Codes . Cambridge, MA, USA: The M.I.T. Press, 1963

1963

Earlier work this paper cites.

A. Gersho and R. M. Gray, Vector Quantization and Signal Compression . Norwell, MA, USA: Kluwer Academic Publishers, 1992

1992

Earlier work this paper cites.

F. R. Kschischang, B. J. Frey, and H.-A. Loeliger, “Factor graphs and the sum-product algorithm,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 498–519, Feb. 2001

2001

Earlier work this paper cites.

T. J. Richardson and R. L. Urbanke, “The capacity of low-density parity-check codes under message-passing decoding,” IEEE Trans. Inform. Theory , vol. 47, no. 2, pp. 599–618, Feb. 2001

2001

Earlier work this paper cites.

A. Schein, A. Popescul, L. Ungar, and D. Pennock, “Methods and metrics for cold-start recommendations,” in Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval . ACM New York, NY, USA, 2002, pp. 253–260

2002

Earlier work this paper cites.

L. Backstrom, D. Huttenlocher, J. Kleinberg, and X. Lan, “Group formation in large social networks: membership, growth, and evolution,” in Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2006, pp. 44–54

2006

Earlier work this paper cites.

A. Montanari, “Estimating random variables from random sparse observations,” Sept. 2007, [Online]. Available: http://arxiv.org/abs/0709.0145

Original

2007

Earlier work this paper cites.

E.J.Candes and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , pp. 1–56, 2008

2008

Cited alongside, same era.

J. Cai, E. Candes, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” Oct. 2008, [Online]. Available: http://arxiv.org/abs/0810.3286

Original

2008

Cited alongside, same era.

R. Salakhutdinov and A. Mnih, “Bayesian probabilistic matrix factorization using Markov chain Monte Carlo,” in Proceedings of the International Conference on Machine Learning , vol. 25, 2008

2008

Cited alongside, same era.

D. Crandall, D. Cosley, D. Huttenlocher, J. Kleinberg, and S. Suri, “Feedback effects between similarity and social influence in online communities,” in Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining . ACM, 2008, pp. 160–168

2008

Cited alongside, same era.

E. Candes and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” March 2009, [Online]. Available: http://arxiv.org/abs/0903.1476

Original

2009

Later among the works it cites.

R. Keshavan, S. Oh, and A. Montanari, “Matrix completion from a few entries,” Sept. 2009, [Online]. Available: http://arxiv.org/abs/0901.3150v4

Original

2009

Later among the works it cites.

S. Aditya, O. Dabeer, and B. Dey, “A channel coding perspective of collaborative filtering,” Aug. 2009, submitted to IEEE Trans. on Inform. Theory

Original

2009

Later among the works it cites.

S. Vishwanath, “Information theoretic bounds for low-rank matrix completion,” Jan. 2010, [Online]. Available: http://arxiv.org/abs/1001.2331

Original

2010

Closest in time.

B.-H. Kim, A. Yedla, and H. D. Pfister, “Message-passing inference on a factor graph for collaborative filtering,” April 2010, [Online]. Available: http://arxiv.org/abs/1004.1003