.png){kind=icon}
Return
Exact Matrix Completion via Convex Optimization
.png){kind=icon}
OA
AI
DOI：10.1145/2184319.2184343.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Suppose that one observes an incomplete subset of entries selected from a low-rank matrix. When is it possible to complete the matrix and recover the entries that have not been seen? We demonstrate that in very general settings, one can perfectly recover all of the missing entries from most sufficiently large subsets by solving a convex programming problem that finds the matrix with the minimum nuclear norm agreeing with the observed entries. The techniques used in this analysis draw upon parallels in the field of compressed sensing, demonstrating that objects other than signals and images can be perfectly reconstructed from very limited information.
Keywords:
INCOHERENCE
ALGORITHMS
SPARSITY
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
12.2
Papers:
1.2W
Citations:
3.7W
Organization
Cited Papers
Local and Systemic Effects of Immune Checkpoint Blockade on Relapsed Myeloid Malignancies Following Allogeneic Hematopoietic Stem Cell Transplantation.png)
Blood
OAAI
BloodIF0
OAAIShareSaveBiogeochemical consequences of regional land use change to a biofuel crop in the southeastern United StatesEcosphereOAAI
EcosphereIF0
OAAIShareSave
View more