Name
Abstract | ||
|---|---|---|
Matrices of low rank can be uniquely determined from fewer linear measurements, or entries, than the total number of entries in the matrix. Moreover, there is a growing literature of computationally efficient algorithms which can recover a low rank matrix from such limited information; this process is typically referred to as matrix completion. We introduce a particularly simple yet highly efficient alternating projection algorithm which uses an adaptive stepsize calculated to be exact for a restricted subspace. This method is proven to have near-optimal order recovery guarantees from dense measurement masks and is observed to have average case performance superior in some respects to other matrix completion algorithms for both dense measurement masks and entry measurements. In particular, this proposed algorithm is able to recover matrices from extremely close to the minimum number of measurements necessary. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1137/120876459 | SIAM JOURNAL ON SCIENTIFIC COMPUTING |
Keywords | Field | DocType |
matrix completion,compressed sensing,low rank approximation,alternating projection | Mathematical optimization,Dykstra's projection algorithm,Matrix completion,Subspace topology,Matrix (mathematics),Adaptive stepsize,Low-rank approximation,Thresholding,Mathematics,Compressed sensing | Journal |
Volume | Issue | ISSN |
35 | 5 | 1064-8275 |
Citations | PageRank | References |
33 | 0.94 | 21 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Jared Tanner | 1 | 525 | 42.48 |
| Ke Wei | 2 | 131 | 7.79 |