Uniqueness of Low-Rank Matrix Completion by Rigidity Theory

The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with applications in collaborative filtering, computer vision, and control. Most recent work has been focused on constructing efficient algorithms for exact or approximate recovery of the missing matrix entries and proving lower bounds for the number of known entries that guarantee a successful recovery with high probability. A related problem from both the mathematical and algorithmic points of view is the distance geometry problem of realizing points in a Euclidean space from a given subset of their pairwise distances. Rigidity theory answers basic questions regarding the uniqueness of the realization satisfying a given partial set of distances. We observe that basic ideas and tools of rigidity theory can be adapted to determine uniqueness of low-rank matrix completion, where inner products play the role that distances play in rigidity theory. This observation leads to efficient randomized algorithms for testing necessary and sufficient conditions for local completion and for testing sufficient conditions for global completion. Crucial to our analysis is a new matrix, which we call the completion matrix, that serves as the analogue of the rigidity matrix.

[1]  J. Maxwell,et al.  The Scientific Papers of James Clerk Maxwell: On the Calculation of the Equilibrium and Stiffness of Frames , 1864 .

[2]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[3]  H. Gluck.  Almost all simply connected closed surfaces are rigid , 1975 .

[4]  B. Roth,et al.  The rigidity of graphs , 1978 .

[5]  E. Bolker,et al.  When is a bipartite graph a rigid framework , 1980 .

[6]  Michael A. Saunders,et al.  LSQR: An Algorithm for Sparse Linear Equations and Sparse Least Squares , 1982, TOMS.

[7]  Bruce Hendrickson,et al.  Conditions for Unique Graph Realizations , 1992, SIAM J. Comput..

[8]  Gene H. Golub,et al.  Matrix computations (3rd ed.) , 1996 .

[9]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

[10]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

[11]  David W. Jacobs,et al.  Linear fitting with missing data: applications to structure-from-motion and to characterizing intensity images , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[12]  G. Papavassilopoulos,et al.  On the rank minimization problem over a positive semidefinite linear matrix inequality , 1997, IEEE Trans. Autom. Control..

[13]  Alexander I. Barvinok,et al.  A Remark on the Rank of Positive Semidefinite Matrices Subject to Affine Constraints , 2001, Discret. Comput. Geom..

[14]  Tommi S. Jaakkola,et al.  Weighted Low-Rank Approximations , 2003, ICML.

[15]  Stephen P. Boyd,et al.  Rank minimization and applications in system theory , 2004, Proceedings of the 2004 American Control Conference.

[16]  Nathan Srebro,et al.  Learning with matrix factorizations , 2004 .

[17]  Takeo Kanade,et al.  Shape and motion from image streams under orthography: a factorization method , 1992, International Journal of Computer Vision.

[18]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[19]  Robert Connelly,et al.  Generic Global Rigidity , 2005, Discret. Comput. Geom..

[20]  Emmanuel J. Candès,et al.  Decoding by linear programming , 2005, IEEE Transactions on Information Theory.

[21]  Steven J. Gortler,et al.  Characterizing generic global rigidity , 2007, Ad Hoc Networks.

[22]  Bill Jackson,et al.  The 2‐dimensional rigidity of certain families of graphs , 2007, J. Graph Theory.

[23]  Andrea Montanari,et al.  Learning low rank matrices from O(n) entries , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[24]  Audrey Lee-St. John,et al.  Pebble game algorithms and sparse graphs , 2007, Discret. Math..

[25]  Amit Singer,et al.  A remark on global positioning from local distances , 2008, Proceedings of the National Academy of Sciences.

[26]  Sivan Toledo,et al.  On the Computation of Null Spaces of Sparse Rectangular Matrices , 2008, SIAM J. Matrix Anal. Appl..

[27]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[28]  Louis Theran,et al.  Rigid Components of Random Graphs , 2008, CCCG.

[29]  Timothy A. Davis,et al.  Multifrontral multithreaded rank-revealing sparse QR factorization , 2009, Combinatorial Scientific Computing.

[30]  Emmanuel J. Candès,et al.  A Singular Value Thresholding Algorithm for Matrix Completion , 2008, SIAM J. Optim..

[31]  Andrea Montanari,et al.  Matrix completion from a few entries , 2009, 2009 IEEE International Symposium on Information Theory.

[32]  Ligang Liu,et al.  An as-rigid-as-possible approach to sensor network localization , 2010, TOSN.

[33]  B. Roth.  Rigid and Flexible Frameworks , 1981 .

[34]  Robert Connelly,et al.  Global Rigidity: The Effect of Coning , 2010, Discret. Comput. Geom..

[35]  Robert H. Halstead,et al.  Matrix Computations , 2011, Encyclopedia of Parallel Computing.

[36]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..