Matrix Completion With Noise Export

@article{citeulike:4751786, abstract = {On the heels of compressed sensing, a remarkable new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data matrix from what appears to be incomplete, and perhaps even corrupted, information. In its simplest form, the problem is to recover a matrix from a small sample of its entries, and comes up in many areas of science and engineering including collaborative filtering, machine learning, control, remote sensing, and computer vision to name a few. This paper surveys the novel literature on matrix completion, which shows that under some suitable conditions, one can recover an unknown low-rank matrix from a nearly minimal set of entries by solving a simple convex optimization problem, namely, nuclear-norm minimization subject to data constraints. Further, this paper introduces novel results showing that matrix completion is provably accurate even when the few observed entries are corrupted with a small amount of noise. A typical result is that one can recover an unknown n x n matrix of low rank r from just about nr log^2 n noisy samples with an error which is proportional to the noise level. We present numerical results which complement our quantitative analysis and show that, in practice, nuclear norm minimization accurately fills in the many missing entries of large low-rank matrices from just a few noisy samples. Some analogies between matrix completion and compressed sensing are discussed throughout.}, archivePrefix = {arXiv}, author = {Candes, Emmanuel J. and Plan, Yaniv}, citeulike-article-id = {4751786}, citeulike-linkout-0 = {http://arxiv.org/abs/0903.3131}, citeulike-linkout-1 = {http://arxiv.org/pdf/0903.3131}, eprint = {0903.3131}, keywords = {compressed\_sensing, convexity, learning\_theory, matrix\_completion, optimization}, month = {Mar}, posted-at = {2009-07-01 19:35:24}, priority = {2}, title = {Matrix Completion With Noise}, url = {http://arxiv.org/abs/0903.3131}, year = {2009} }

TY - JOUR ID - citeulike:4751786 L3 - citeulike-article-id:4751786 N2 - On the heels of compressed sensing, a remarkable new field has very recently emerged. This field addresses a broad range of problems of significant practical interest, namely, the recovery of a data matrix from what appears to be incomplete, and perhaps even corrupted, information. In its simplest form, the problem is to recover a matrix from a small sample of its entries, and comes up in many areas of science and engineering including collaborative filtering, machine learning, control, remote sensing, and computer vision to name a few. This paper surveys the novel literature on matrix completion, which shows that under some suitable conditions, one can recover an unknown low-rank matrix from a nearly minimal set of entries by solving a simple convex optimization problem, namely, nuclear-norm minimization subject to data constraints. Further, this paper introduces novel results showing that matrix completion is provably accurate even when the few observed entries are corrupted with a small amount of noise. A typical result is that one can recover an unknown n x n matrix of low rank r from just about nr log^2 n noisy samples with an error which is proportional to the noise level. We present numerical results which complement our quantitative analysis and show that, in practice, nuclear norm minimization accurately fills in the many missing entries of large low-rank matrices from just a few noisy samples. Some analogies between matrix completion and compressed sensing are discussed throughout. TI - Matrix Completion With Noise KW - compressed_sensing KW - convexity KW - learning_theory KW - matrix_completion KW - optimization AU - Candes, Emmanuel AU - Plan, Yaniv PY - 2009/Mar/18/ UR - http://arxiv.org/abs/0903.3131 ER -