Abstract

We consider linear equations y = Φα where y is a given vector in R n, Φ is a given n by m matrix with n < m ≤ An, and we wish to solve for α ∈ R m. We suppose that the columns of Φ are normalized to unit ℓ 2 norm 1 and we place uniform measure on such Φ. We prove the existence of ρ = ρ(A) so that for large n, and for all Φ’s except a negligible fraction, the following property holds: For every y having a representation y = Φα0 by a coefficient vector α0 ∈ R m with fewer than ρ · n nonzeros, the solution α1 of the ℓ 1 minimization problem min �x�1 subject to Φα = y is unique and equal to α0. In contrast, heuristic attempts to sparsely solve such systems – greedy algorithms and thresholding – perform poorly in this challenging setting. The techniques include the use of random proportional embeddings and almost-spherical sections in Banach space theory, and deviation bounds for the eigenvalues of random Wishart matrices.

Citations

1089	Atomic decomposition by basis pursuit - Chen, Donoho, et al. - 1998
714	Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information - Candes, Romberg, et al. - 2006
699	Matching Pursuits with Time-Frequency Dictionaries - 27Mallat, Zhang - 1993
327	Greed is good: Algorithmic results for sparse approximation - Tropp - 2004
231	The concentration of measure phenomenon - Ledoux - 2001
220	The Volume of Convex Bodies and Banach Space Geometry, Cambridge Tracts - Pisier - 1989
207	Sparse approximate solutions to linear systems - Natarajan - 1995
188	Eigenvalues and condition numbers of random matrices - Edelman - 1988
152	Sparse representations in unions of bases - Gribonval, Nielsen - 2003
108	On sparse representations in arbitrary redundant bases - Fuchs - 2004
106	Asymptotic theory of finite-dimensional normed spaces, volume 1200 - Milman, Schechtman - 1986
105	On projection algorithms for solving convex feasibility problems - Bauschke, Borwein - 1996
83	Empirical processes: theory and applications - Pollard - 1990
82	Entropy Based Algorithms for Best Basis Selection - Coifman, Wickerhauser
71	Just relax: Convex programming methods for subset selection and sparse approximation,” UT-Austin, ICES - Tropp - 2004
69	Local operator theory, random matrices, and Banach spaces - Davidson, Szarek - 2001
15	Optimally sparse representation from overcomplete distionaries via l1 norm minimization, Proc - Donoho, Elad
12	Random embeddings of Euclidean spaces in sequence spaces - Schechtman - 1981
7	Spaces with large distance to ℓ n ∞ and random matrices - Szarek - 1990
5	Some results on convex bodies and Banach spaces - Dvoretsky - 1961
5	2002) A generalized uncertainty principle and sparse representations in pairs of bases - Elad, Bruckstein
4	Xiaoming (2001) Uncertainty Principles and Ideal Atomic Decomposition - Donoho, Huo - 2001
3	The dimension of almost-spherical sections of convex bodies - Figiel, Lindenstrauss, et al. - 1977
2	Karoui (2004) New Results About Random Covariance Matrices and Statistical Applications - El
1	Embedding ℓm p into ℓn 1 - Johnson, Schechtman - 1982