.png){kind=icon}
返回
Exact Matrix Completion via Convex Optimization
.png){kind=icon}
OA
AI
DOI：10.1145/2184319.2184343.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
INCOHERENCE
ALGORITHMS
SPARSITY
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
12.2
论文数:
1.2W
被引数:
3.7W
机构
引用论文
Local and Systemic Effects of Immune Checkpoint Blockade on Relapsed Myeloid Malignancies Following Allogeneic Hematopoietic Stem Cell Transplantation.png)
Blood
OAAI
BloodIF0
OAAI分享收藏Biogeochemical consequences of regional land use change to a biofuel crop in the southeastern United StatesEcosphereOAAI
EcosphereIF0
OAAI分享收藏Normative pediatric visual acuity using single surrounded HOTV optotypes on the Electronic Visual Acuity Tester following the Amblyopia Treatment Study protocol根据弱视治疗研究方案，在电子视力测试仪上使用单个包围的HOTV视标的儿童视力OAAI
OAAI分享收藏
查看更多内容