Atomic Decomposition by Basis Pursuit
SIAM Journal on Scientific Computing
Decoding by linear programming
IEEE Transactions on Information Theory
Stable recovery of sparse overcomplete representations in the presence of noise
IEEE Transactions on Information Theory
Hi-index | 0.00 |
We prove sharp bounds for the expectation of the supremum of the Gaussian process indexed by the intersection of B"p^n with @rB"q^n for 1=0, and by the intersection of B"p"~^n with @rB"2^n for 00. We present an application of this result to a statistical problem known as the approximate reconstruction problem.