
Adversarial Robust Low Rank Matrix Estimation: Compressed Sensing and Matrix Completion
We consider robust low rank matrix estimation when random noise is heavy...
read it

Exact Reconstruction of Euclidean Distance Geometry Problem Using Lowrank Matrix Completion
The Euclidean distance geometry problem arises in a wide variety of appl...
read it

Completing LowRank Matrices with Corrupted Samples from Few Coefficients in General Basis
Subspace recovery from corrupted and missing data is crucial for various...
read it

A Characterization of Deterministic Sampling Patterns for LowRank Matrix Completion
Lowrank matrix completion (LRMC) problems arise in a wide variety of ap...
read it

Binary component decomposition Part II: The asymmetric case
This paper studies the problem of decomposing a lowrank matrix into a f...
read it

Coherence and sufficient sampling densities for reconstruction in compressed sensing
We give a new, very general, formulation of the compressed sensing probl...
read it

Novel Structured Lowrank algorithm to recover spatially smooth exponential image time series
We propose a structured low rank matrix completion algorithm to recover ...
read it
Lowrank Matrix Completion in a General Nonorthogonal Basis
This paper considers theoretical analysis of recovering a low rank matrix given a few expansion coefficients with respect to any basis. The current approach generalizes the existing analysis for the lowrank matrix completion problem with sampling under entry sensing or with respect to a symmetric orthonormal basis. The analysis is based on dual certificates using a dual basis approach and does not assume the restricted isometry property (RIP). We introduce a condition on the basis called the correlation condition. This condition can be computed in time O(n^3) and holds for many cases of deterministic basis where RIP might not hold or is NP hard to verify. If the correlation condition holds and the underlying low rank matrix obeys the coherence condition with parameter ν, under additional mild assumptions, our main result shows that the true matrix can be recovered with very high probability from O(nrν^2n) uniformly random expansion coefficients.
READ FULL TEXT
Comments
There are no comments yet.