arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0906.2027cs.LGstat.ML
收藏

从Noisy矩阵完成

Matrix Completion from Noisy Entries

Stanford University(斯坦福大学)

Raghunandan H. Keshavan, Andrea Montanari, Sewoong Oh

摘要:

给定一个矩阵M的低秩,我们考虑的问题,重建它从一个小的,随机子集的条目的噪声观测。这个问题出现在各种各样的应用中,从协同过滤(“Netflix问题”)到从运动到结构和定位。我们研究了Keshavan等人提出的一种低复杂度的算法。(2009),基于光谱技术和流形优化的组合,我们在这里称之为OptSpace。我们证明了性能保证,在一些情况下是最优的顺序。

英文摘要:

Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of applications, from collaborative filtering (the `Netflix problem') to structure-from-motion and positioning. We study a low complexity algorithm introduced by Keshavan et al.(2009), based on a combination of spectral techniques and manifold optimization, that we call here OptSpace. We prove performance guarantees that are order-optimal in a number of circumstances.

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

↑