arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1907.11705cs.DScs.ITmath.ITmath.OC
收藏

低秩矩阵完备化的研究进展

Low-Rank Matrix Completion: A Contemporary Survey

Luong Trung Nguyen, Junhan Kim, Byonghyo Shim

摘要:

作为从部分观测值中恢复矩阵未知元素的一种范例,低秩矩阵完备化(LRMC)引起了人们的极大兴趣。多年来,有很多关于这个主题的著作,但要从这些研究中掌握基本知识可能并不容易。这主要是因为这些工作中有许多是高度理论性的或新的LRMC技术的建议。本文对LRMC的研究现状进行了综述。为了提供更好的观点,洞察力,并了解LRMC的潜力和局限性,我们提出了一个结构化的和可访问的方式早期分散的结果。具体来说,我们将最先进的LRMC技术分为两大类,然后详细解释每一类。我们接下来讨论当考虑使用LRMC技术时要考虑的问题。这些包括所需的矩阵恢复和如何利用一个特殊的结构在LRMC设计的内在属性。我们还讨论了基于卷积神经网络(CNN)的LRMC算法,利用低秩矩阵的图形结构。此外,我们提出的恢复性能和计算复杂性的国家的最先进的LRMC技术。我们希望这篇调查文章能为从业者和非专家提供有用的指导,以抓住LRMC的要点。

英文摘要:

As a paradigm to recover unknown entries of a matrix from partial observations, low-rank matrix completion (LRMC) has generated a great deal of interest. Over the years, there have been lots of works on this topic but it might not be easy to grasp the essential knowledge from these studies. This is mainly because many of these works are highly theoretical or a proposal of new LRMC technique. In this paper, we give a contemporary survey on LRMC. In order to provide better view, insight, and understanding of potentials and limitations of LRMC, we present early scattered results in a structured and accessible way. Specifically, we classify the state-of-the-art LRMC techniques into two main categories and then explain each category in detail. We next discuss issues to be considered when one considers using LRMC techniques. These include intrinsic properties required for the matrix recovery and how to exploit a special structure in LRMC design. We also discuss the convolutional neural network (CNN) based LRMC algorithms exploiting the graph structure of a low-rank matrix. Further, we present the recovery performance and the computational complexity of the state-of-the-art LRMC techniques. Our hope is that this survey article will serve as a useful guide for practitioners and non-experts to catch the gist of LRMC.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑