Uniqueness of low-rank matrix completion by rigidity theory

SIAM Journal on Matrix Analysis and Applications

Volumn 31, Issue 4, 2009, Pages 1621-1641

  Singer, Amit ^a   Cucuringu, Mihai ^a  

^a PRINCETON UNIVERSITY   (United States)

Author keywords

Collaborative filtering; Iterative methods; Low rank matrices; Missing values; Rigidity theory

Indexed keywords

BASIC IDEA; COLLABORATIVE FILTERING; DISTANCE GEOMETRY; EFFICIENT ALGORITHM; EUCLIDEAN SPACES; HIGH PROBABILITY; INCOMPLETE DATA; INNER PRODUCT; LOW-RANK MATRICES; LOWER BOUNDS; MATRIX; MISSING VALUES; PAIRWISE DISTANCES; RANDOMIZED ALGORITHMS; SUFFICIENT CONDITIONS; UNDERLYING FACTORS;

ALGORITHMS; COMPUTER VISION; ITERATIVE METHODS; RIGIDITY; SIGNAL FILTERING AND PREDICTION;

MATRIX ALGEBRA;

EID: 77956028031     PISSN: 08954798     EISSN: 10957162     Source Type: Journal    
DOI: 10.1137/090750688     Document Type: Article

References (38)

1. ACM SIGKDD and Netflix, Proceedings of KDD Cup and Workshop, 2007, http://www.cs.uic.edu/?liub/KDD-cup-2007/proceedings.html.
2. L. Asimow and B. Roth, The rigidity of graphs, Trans. Amer. Math. Soc., 245 (1978), pp. 279-289.
3. A. Barvinok, A remark on the rank of positive semidefinite matrices subject to affine constraints, Discrete Comput. Geom., 25 (2001), pp. 23-31. (Pubitemid 33588076)
4. E. D. Bolker and B. Roth, When is a bipartite graph a rigid framework?, Pacific J. Math., 90 (1980), pp. 27-44.
5. J.-F. Cai, E. J. Candès, and Z. A. Shen, Singular value thresholding algorithm for matrix completion, SIAM J. Optim., to appear.
6. E. J. Candès and T. Tao, Decoding by linear programming, IEEE Trans. Inform. Theory, 51 (2005), pp. 4203-4215.
7. E. J. Candès and B. Recht, Exact matrix completion via convex optimization, Found. Comput. Math., 9 (2009), pp. 717-722.
8. R. Connelly, On generic global rigidity, in Applied Geometry and Discrete Mathematics, DIMACS Ser. Discrete Math., Theoret. Comput. Sci. 4, AMS, Providence, RI, 1991, pp. 147-155.
9. R. Connelly, Generic global rigidity, Discrete Comput. Geom., 33 (2005), pp. 549-563.
10. R. Connelly and W. J. Whiteley, Global rigidity: The effect of coning, Discrete and Computational Geometry, Springer, New York, 2009.
11. T. Davis, Multifrontal multithreaded rank-revealing sparse QR factorization, submitted to ACM Trans. Math. Software.
12. D. L. Donoho, Compressed sensing, IEEE Trans. Inform. Theory, 52 (2006), pp. 1289-1306.
13. M. Fazel, Matrix Rank Minimization with Applications, Ph.D. thesis, Elec. Eng. Dept., Stanford University, Stanford, CA, 2002.
14. M. Fazel, H. Hindi, and S. Boyd, Rank minimization and applications in system theory, in Proceedings of American Control Conference, Boston, MA, 2004, pp. 3273-3278.
15. H. Gluck, Almost all simply connected closed surfaces are rigid, in Geometric Topology, Lect. Notes Math. 438, Springer-Verlag, Berlin, 1975, pp. 225-239.
16. G. H. Golub and C. F. V. Loan, Matrix Computations, 3rd ed., Johns Hopkins University Press, Baltimore, MD, 1996, p. 694.
17. S. J. Gortler, A. Healy, and D. Thurston, Characterizing Generic Global Rigidity, preprint arXiv:0710.0926v4.
18. C. Gotsman and S. Toledo, On the computation of null spaces of sparse rectangular matrices, SIAM J. Matrix Anal. Appl., 30 (2008), pp. 445-463.
19. B. Hendrickson, Conditions for unique graph realizations, SIAM J. Comput., 21 (1992), pp. 65-84.
20. B. Jackson and T. Jordan, Connected rigidity matroids and unique realization graphs, J. Combin. Theory Ser. B, 94 (2005), pp. 1-29.
21. B. Jackson, B. Servatius, and H. Servatius, The 2-dimensional rigidity of certain families of graphs, J. Graph Theory, 54 (2006), pp. 154-166.
22. D. Jacobs, Linear fitting with missing data: Applications to structure-from-motion and to characterizing intensity images, in IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'97), IEEE, New York, 1997, pp. 206-212.
23. D. J. Jacobs and B. Hendrickson, An algorithm for two-dimensional rigidity percolation: The pebble game, J. Comput. Phys., 137 (1997), pp. 346-365.
24. R. Keshavan, A. Montanari, and S. Oh, Learning low rank matrices from O(n) entries, in Proceedings of the Allerton Conference on Communication, Control and Computing, 2008.
25. R. Keshavan, S. Oh, and A. Montanari, Matrix Completion from a Few Entries, ISIT 2009, submitted.
26. G. Laman, On graphs and rigidity of plane skeletal structures, J. Engrg. Math., 4 (1970), pp. 331-340.
27. A. Lee and I. Streinu, Pebble game algorithms and sparse graphs, Discrete Math., 308 (2008), pp. 1425-1437.
28. J. C. Maxwell, On the calculation of the equilibrium and stiffness of frames, Philos. Mag., 27 (1864), pp. 294-299.
29. M. Mesbahi and G. P. Papavassilopoulos, On the rank minimization problem over a positive semidefinite linear matrix inequality, IEEE Trans. Automat. Control, 42 (1997), pp. 239- 243.
30. C. C. Paige and M. A. Saunders, LSQR: An algorithm for sparse linear equations and sparse least squares, ACM Trans. Math. Software, 8 (1982), pp. 43-71.
31. B. Roth, Rigid and flexible frameworks, Amer. Math. Monthly, 88 (1981), pp. 6-21.
32. A. Singer, A remark on global positioning from local distances, Proc. Natl. Acad. Sci., USA, 105 (2008), pp. 9507-9511.
33. N. Srebro, Learning with Matrix Factorizations, Ph.D. thesis, Massachusetts Institute of Technology, Cambridge, MA, 2004.
34. N. Srebro and T. Jaakkola, Weighted low-rank approximations, in Proceedings of the Twentieth International Conference on Machine Learning (ICML), 2003, pp. 720-727.
35. L. Theran, Rigid Components of Random Graphs, preprint arXiv:0812.0872, 2008.
36. C. Tomasi and T. Kanade, Shape and motion from image streams under orthography: A factorization method, Int. J. Comput. Vision, 9 (1992), pp. 137-154.
37. L. Vandenberghe and S. P. Boyd, Semidefinite programming, SIAM Rev., 38 (1996), pp. 49-95.
38. L. Zhang, L. Liu, C. Gotsman, and S. J. Gortler, An As-Rigid-As-Possible Approach to Sensor Network Localization, Harvard Computer Science Technical report TR-01-09, 2009.