ResearchTrend.AI
Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion

Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion

Franz J. Király
Louis Theran
ArXivPDFHTML

Papers citing "Obtaining error-minimizing estimates and universal entry-wise error bounds for low-rank matrix completion"

2 / 2 papers shown
Title
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
The Algebraic Combinatorial Approach for Low-Rank Matrix Completion
Franz J. Király
Louis Theran
Ryota Tomioka
121
111
0
17 Nov 2012
Matrix Completion from a Few Entries
Matrix Completion from a Few Entries
Raghunandan H. Keshavan
Andrea Montanari
Sewoong Oh
315
1,242
0
20 Jan 2009

We use cookies and other tracking technologies to improve your browsing experience on our website, to show you personalized content and targeted ads, to analyze our website traffic, and to understand where our visitors are coming from. See our policy.