返回
Robust Matrix Completion via Alternating Projection
DOI:10.1109/LSP.2017.2685518.png)
摘要
En 中文
Matrix completion aims to find the missing entries from incomplete observations using the low-rank property. Conventional convex optimization based techniques for matrix completion minimize the nuclear norm subject to a constraint on the Frobenius norm of the residual. However, they are not robust to outliers and have a high computational complexity. Different from the existing schemes based on solving a minimization problem, we formulate matrix completion as a feasibility problem. An alternating projection algorithm (APA) is devised to find a feasible point in the intersection of the low-rank constraint set and fidelity constraint set. To achieve resistance to outliers, the fidelity constraint set is modeled as an l(p)-ball, where the ball center corresponds to the observed data. Furthermore, there is no stepsize within the framework of APA. Convergence of the APA is analyzed and the local linear convergence rate is established. Simulation results demonstrate the efficiency, accuracy, and outlier robustness of the APA.
Keyword:
Alternating projection
matrix completion
outlier
projection onto l(p)-ball
robust recovery
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
High mobility group box 1 antagonist limits metastatic seeding in the lungs via reduction of cell-cell adhesion
Oncotarget
IF0
Enhancing the Silanization Reaction of the Silica-Silane System by Different Amines in Model and Practical Silica-Filled Natural Rubber Compounds
Polymers
IF0

