Computer Science – Information Theory
Scientific paper
2010-03-17
Computer Science
Information Theory
16 pages, 8 figures
Scientific paper
The Restricted Isometry Constants (RIC) of a matrix $A$ measures how close to an isometry is the action of $A$ on vectors with few nonzero entries, measured in the $\ell^2$ norm. Specifically, the upper and lower RIC of a matrix $A$ of size $n\times N$ is the maximum and the minimum deviation from unity (one) of the largest and smallest, respectively, square of singular values of all ${N\choose k}$ matrices formed by taking $k$ columns from $A$. Calculation of the RIC is intractable for most matrices due to its combinatorial nature; however, many random matrices typically have bounded RIC in some range of problem sizes $(k,n,N)$. We provide the best known bound on the RIC for Gaussian matrices, which is also the smallest known bound on the RIC for any large rectangular matrix. Improvements over prior bounds are achieved by exploiting similarity of singular values for matrices which share a substantial number of columns.
Bah Bubacarr
Tanner Jared
No associations
LandOfFree
Improved Bounds on Restricted Isometry Constants for Gaussian Matrices does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Improved Bounds on Restricted Isometry Constants for Gaussian Matrices, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Improved Bounds on Restricted Isometry Constants for Gaussian Matrices will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-233494