Please use this identifier to cite or link to this item: https://oar.tib.eu/jspui/handle/123456789/3424
Files in This Item:
File SizeFormat 
OWP2013_12.pdf353,39 kBAdobe PDFView/Open
Title: Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion
Authors: Király, Franz J.Theran, Louis
Publishers Version: https://doi.org/10.14760/OWP-2013-12
Issue Date: 2013
Published in: Oberwolfach Preprints (OWP), Volume 2013-12, ISSN 1864-7596
Publisher: Oberwolfach : Mathematisches Forschungsinstitut Oberwolfach
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.
DDC: 510
License: CC BY-SA 3.0 US
Link to License: https://creativecommons.org/licenses/by-sa/3.0/us/
Appears in Collections:Mathematik



This item is licensed under a Creative Commons License Creative Commons