arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1402.2331cs.CCcs.LG
收藏

矩阵完备化的计算极限

Computational Limits for Matrix Completion

IBM Research Almaden(IBM阿尔马登研究院);Microsoft Research(微软研究院);University of California, Berkeley(加州大学伯克利分校)

Moritz Hardt, Raghu Meka, Prasad Raghavendra, Benjamin Weitz

摘要:

矩阵完备化是从一个未知的实值低秩矩阵的子样本中恢复该矩阵的问题。最近的重要结果表明,该问题可以有效地解决的假设下,未知矩阵是不相干的,子样本是均匀随机抽取。这些假设是必要的吗?众所周知,矩阵完备化在其全部一般性上是NP-困难的。然而,很少有人知道,如果作出额外的假设,如不一致性,并允许算法输出一个矩阵的秩略高。在本文中,我们证明了矩阵完成仍然是计算棘手的,即使未知矩阵的秩$4$,但我们可以输出任何常数秩矩阵,即使另外,我们假设未知矩阵是不相干的,并显示$90%$的条目。该结果依赖于$4$着色问题的非线性硬度。我们还考虑了半正定矩阵的完备化问题。在这里,我们显示了一个类似的硬度下的标准假设,$\mathrm{P}\ne \mathrm{NP}.$我们的结果大大缩小了现有的可行性结果和计算下限之间的差距。特别是,我们认为,我们的研究结果给出了第一个复杂性理论的理由,为什么需要分布假设超越不一致的假设,以获得积极的结果。在技术方面,我们贡献了几个新的想法,如何编码的低秩优化问题的硬组合问题。我们希望这些技术将有助于进一步理解矩阵完备的计算极限和相关问题。

英文摘要:

Matrix Completion is the problem of recovering an unknown real-valued low-rank matrix from a subsample of its entries. Important recent results show that the problem can be solved efficiently under the assumption that the unknown matrix is incoherent and the subsample is drawn uniformly at random. Are these assumptions necessary? It is well known that Matrix Completion in its full generality is NP-hard. However, little is known if make additional assumptions such as incoherence and permit the algorithm to output a matrix of slightly higher rank. In this paper we prove that Matrix Completion remains computationally intractable even if the unknown matrix has rank $4$ but we are allowed to output any constant rank matrix, and even if additionally we assume that the unknown matrix is incoherent and are shown $90%$ of the entries. This result relies on the conjectured hardness of the $4$-Coloring problem. We also consider the positive semidefinite Matrix Completion problem. Here we show a similar hardness result under the standard assumption that $\mathrm{P}\ne \mathrm{NP}.$ Our results greatly narrow the gap between existing feasibility results and computational lower bounds. In particular, we believe that our results give the first complexity-theoretic justification for why distributional assumptions are needed beyond the incoherence assumption in order to obtain positive results. On the technical side, we contribute several new ideas on how to encode hard combinatorial problems in low-rank optimization problems. We hope that these techniques will be helpful in further understanding the computational limits of Matrix Completion and related problems.

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

↑