dc.contributor.author Király, Franz J. dc.contributor.author Theran, Louis dc.date.accessioned 2016-09-22T10:46:38Z dc.date.available 2016-09-22T10:46:38Z dc.date.issued 2013-06-10 dc.identifier.uri http://publications.mfo.de/handle/mfo/196 dc.description OWLF 2013 en_US dc.description.abstract We propose a general framework for reconstructing and denoising single entries of incomplete and noisy entries. We describe: effective algorithms for deciding if and entry can be reconstructed and, if so, for reconstructing and denoising it; and a priori bounds on the error of each entry, individually. In the noiseless case our algorithm is exact. For rank-one matrices, the new algorithm is fast, admits a highly-parallel implementation, and produces an error minimizing estimate that is qualitatively close to our theoretical and the state-of-the-art Nuclear Norm and OptSpace methods. en_US dc.language.iso en en_US dc.publisher Mathematisches Forschungsinstitut Oberwolfach en_US dc.relation.ispartofseries Oberwolfach Preprints;2013,12 dc.title Obtaining Error-Minimizing Estimates and Universal Entry-Wise Error Bounds for Low-Rank Matrix Completion en_US dc.type Preprint en_US dc.identifier.doi 10.14760/OWP-2013-12 local.scientificprogram OWLF 2013 local.series.id OWP-2013-12
﻿