Sciweavers

27 search results - page 1 / 6
» Matrix Completion from Noisy Entries
Sort
View
JMLR
2010
109views more  JMLR 2010»
12 years 11 months ago
Matrix Completion from Noisy Entries
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
CORR
2008
Springer
151views Education» more  CORR 2008»
13 years 5 months ago
Exact Matrix Completion via Convex Optimization
We consider a problem of considerable practical interest: the recovery of a data matrix from a sampling of its entries. Suppose that we observe m entries selected uniformly at ran...
Emmanuel J. Candès, Benjamin Recht
TIT
2010
93views Education» more  TIT 2010»
12 years 11 months ago
Matrix completion from a few entries
Raghunandan H. Keshavan, Andrea Montanari, Sewoong...
ICASSP
2010
IEEE
13 years 5 months ago
Distributed bearing estimation via matrix completion
We consider bearing estimation of multiple narrow-band plane waves impinging on an array of sensors. For this problem, bearing estimation algorithms such as minimum variance disto...
Andrew Waters, Volkan Cevher
CORR
2010
Springer
115views Education» more  CORR 2010»
13 years 3 months ago
Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements
This paper presents several novel theoretical results regarding the recovery of a low-rank matrix from just a few measurements consisting of linear combinations of the matrix entr...
Emmanuel J. Candès, Yaniv Plan