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

矩阵完备化的信息论

Information Theory of Matrix Completion

Changho Suh

摘要:

矩阵补全是一个基本问题,出现在各种应用程序中,如Netflix问题,协同过滤,计算机视觉和众包。该问题的目标是从其无噪声(或噪声)条目的子集中恢复k × n未知矩阵。我们定义了一个信息理论的概念,完成能力C,量化的最大数量的条目,一个观察的条目可以解决。这个数提供了可靠重建所需的最小条目数m:m=kn/C。将该问题转化为一个带编码器约束的分布式联合信源-信道编码问题,刻画了未知矩阵和观测过程的一类随机模型的完备容量。我们的可验证性证明受到Slepian-Wolf定理的启发。对于任意的随机矩阵,我们得到了一个上界的完成能力。

英文摘要:

Matrix completion is a fundamental problem that comes up in a variety of applications like the Netflix problem, collaborative filtering, computer vision, and crowdsourcing. The goal of the problem is to recover a k-by-n unknown matrix from a subset of its noiseless (or noisy) entries. We define an information-theoretic notion of completion capacity C that quantifies the maximum number of entries that one observation of an entry can resolve. This number provides the minimum number m of entries required for reliable reconstruction: m=kn/C. Translating the problem into a distributed joint source-channel coding problem with encoder restriction, we characterize the completion capacity for a wide class of stochastic models of the unknown matrix and the observation process. Our achievability proof is inspired by that of the Slepian-Wolf theorem. For an arbitrary stochastic matrix, we derive an upper bound on the completion capacity.

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

↑