How well can we estimate a sparse vector?

Applied and Computational Harmonic Analysis

Volumn 34, Issue 2, 2013, Pages 317-323

  Candès, Emmanuel J ^a   Davenport, Mark A ^b  

^a STANFORD UNIVERSITY   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Compressive sensing; Fanos inequality; Matrix Bernstein inequality; Minimax lower bounds; Sparse estimation; Sparse linear regression

Indexed keywords

COMPRESSED SENSING; MEAN SQUARE ERROR;

BERNSTEIN INEQUALITIES; COMPRESSIVE SENSING; FANOS INEQUALITY; LOWER BOUNDS; SPARSE ESTIMATION; SPARSE LINEAR REGRESSIONS;

MATRIX ALGEBRA;

EID: 84872329247     PISSN: 10635203     EISSN: 1096603X     Source Type: Journal    
DOI: 10.1016/j.acha.2012.08.010     Document Type: Letter

References (19)

1. S. Aeron, V. Saligrama, and M. Zhao Information theoretic bounds for compressed sensing IEEE Trans. Inform. Theory 56 10 2010 5111 5130
2. R. Ahlswede, and A. Winter Strong converse for identification via quantum channels IEEE Trans. Inform. Theory 48 3 2002 569 579
3. P. Bickel, Y. Ritov, and A. Tsybakov Simultaneous analysis of Lasso and Dantzig selector Ann. Statist. 37 4 2009 1705 1732
4. E. Candès, J. Romberg, and T. Tao Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information IEEE Trans. Inform. Theory 52 2 2006 489 509
5. E. Candès, and T. Tao Near optimal signal recovery from random projections: Universal encoding strategies? IEEE Trans. Inform. Theory 52 12 2006 5406 5425
6. E. Candès, and T. Tao The Dantzig selector: Statistical estimation when p is much larger than n Ann. Statist. 35 6 2007 2313 2351
7. T. Cover, and J. Thomas Elements of Information Theory 1991 Wiley-Interscience New York
8. D. Donoho Compressed sensing IEEE Trans. Inform. Theory 52 4 2006 1289 1306
9. ℓp balls: Minimax mean square error arXiv:1103.1943 2011
10. T. Han, and S. Verdú Generalizing the Fano inequality IEEE Trans. Inform. Theory 40 4 1994 1247 1251
11. T. Kühn A lower estimate for entropy numbers J. Approx. Theory 110 1 2001 120 124
12. E. Lehman, and G. Casella Theory of Point Estimation 1998 Springer-Verlag New York
13. K. Lounici Generalized mirror averaging and d-convex aggregation Math. Methods Statist. 16 3 2007 246 259
14. G. Raskutti, M. Wainwright, B. Yu, Lower bounds on minimax rates for nonparametric regression with additive sparsity and smoothness, in: Proc. Adv. in Neural Proc. Systems (NIPS), Vancouver, BC, December 2009.
15. ℓq-balls IEEE Trans. Inform. Theory 57 10 2011 6976 6994
16. P. Rigollet, and A. Tsybakov Exponential screening and optimal rates of sparse estimation Ann. Statist. 39 2 2011 731 771
17. S. Sarvotham, D. Baron, R. Baraniuk, Measurements vs. bits: Compressed sensing meets information theory, in: Proc. Allerton Conf. Communication, Control, and Computing, Monticello, IL, September 2006.
18. J. Tropp User-friendly tail bounds for sums of random matrices Found. Comput. Math. 12 4 2012 389 434
19. ℓr balls J. Mach. Learn. Res. 11 2010 3519 3540