Compressed Sensing over ℓp-balls: Minimax mean square error

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2011, Pages 129-133

  Donoho, David ^a   Johnstone, Iain ^a   Maleki, Arian ^b   Montanari, Andrea ^a  

^a STANFORD UNIVERSITY   (United States)

^b RICE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ASYMPTOTIC MEAN SQUARE ERROR; BASIS PURSUITS; COMPRESSED SENSING; EXPLICIT FORMULA; GAUSSIANS; INCOMPLETE MEASUREMENTS; MATRIX; MAXIMIN; MINIMAX; PENALIZED LEAST-SQUARES; RANDOM MATRIX; SCALING LIMITS; SOFT THRESHOLDING; SPARSE SIGNALS; STATISTICAL DECISION THEORY;

ASYMPTOTIC ANALYSIS; DECISION THEORY; INFORMATION THEORY; SIGNAL RECONSTRUCTION;

MEAN SQUARE ERROR;

EID: 80054820466     PISSN: 21578104     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2011.6033747     Document Type: Conference Paper

References (25)

1. D. L. Donoho, "Compressed sensing", IEEE Transactions on Information Theory, vol. 52, pp. 489-509, April 2006.
2. -, "High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension", Discrete Comput. Geometry, vol. 35, pp. 617-652, 2006.
3. D. L. Donoho and J. Tanner, "Neighborliness of randomly-projected simplices in high dimensions", Proceedings of the National Academy of Sciences, vol. 102, no. 27, pp. 9452-9457, 2005.
4. -, "Precise undersampling theorems", Proceedings of the IEEE, vol. 98, pp. 913-924, 2010.
5. D. Donoho, A. Maleki, and A. Montanari, "The Noise Sensitivity Phase Transition in Compressed Sensing", 2010, arXiv:1004.1218.
6. M. Bayati and A. Montanari, "The dynamics of message passing on dense graphs, with applications to compressed sensing", IEEE Trans. on Inform. Theory, 2010, arXiv:1001.3448.
7. E. J. Candès and T. Tao, "Decoding by linear programming", IEEE Trans. on Inform. Theory, vol. 51, pp. 4203-4215, 2005.
8. E. Candès, J. K. Romberg, and T. Tao, "Stable signal recovery from incomplete and inaccurate measurements", Communications on Pure and Applied Mathematics, vol. 59, pp. 1207-1223, 2006.
9. E. Candès and T. Tao, "The Dantzig selector: statistical estimation when p is much larger than n", Annals of Statistics, vol. 35, pp. 2313-2351, 2007.
10. P. J. Bickel, Y. Ritov, and A. B. Tsybakov, "Simultaneous analysis of Lasso and Dantzig selector", Amer. J. of Mathematics, vol. 37, pp. 1705-1732, 2009.
11. S. A. van de Geer and P. Bühlmann, "On the conditions used to prove oracle results for the Lasso", Electron. J. Statist., vol. 3, pp. 1360-1392, 2009.
12. R. Berinde, A. Gilbert, P. Indyk, H. Karloff, and M. Strauss, "Combining geometry and combinatorics: A unified approach to sparse signal recovery", in 47th Annual Allerton Conference, Monticello, IL, Sep. 2008.
13. q- balls", in 47th Annual Allerton Conference, Monticello, IL, Sep. 2009.
14. D. L. Donoho, A. Maleki, and A. Montanari, "Message Passing Algorithms for Compressed Sensing", Proceedings of the National Academy of Sciences, vol. 106, pp. 18914-18919, 2009.
15. M. Bayati and A. Montanari, "The LASSO risk for gaussian matrices", 2010, arXiv:1008.2581.
16. E. Candés and Y. Plan, "A probabilistic and RIPless theory of compressed sensing", 2010, arXiv:1011.3854.
17. R. Tibshirani, "Regression shrinkage and selection with the lasso", J. Royal. Statist. Soc B, vol. 58, pp. 267-288, 1996.
18. S. Chen and D. Donoho, "Examples of basis pursuit", in Proc. of Wavelet Applications in Signal and Image Processing III, San Diego, CA, 1995.
19. B. Kashin, "Diameters of Some Finite-Dimensional Sets and Classes of Smooth Functions", Math. USSR Izv., vol. 11, pp. 317-333, 1977.
20. A. Garnaev and E. Gluskin, "On widths of the euclidean ball", Soviet Mathematics Doklady, vol. 30, pp. 200-203, 1984.
21. p balls", Prob. Th. and Rel. Fields, vol. 99, pp. 277-303, 1994.
22. I. M. Johnstone, "Minimax bayes, asymptotic minimax and sparse wavelet priors", in in Statistical Decision Theory and Related Topics, V. Springer-Verlag, 1993, pp. 303-326.
23. Y. Kabashima, T. Wadayama, and T. Tanaka, "A typical reconstruction limit for compressed sensing based on lp-norm minimization", J. Stat. Mech., p. L09003, 2009.
24. D. Guo, D. Baron, and S. Shamai, "A single-letter characterization of optimal noisy compressed sensing", in 47th Annual Allerton Conference, Monticello, IL, Sep. 2009.
25. S. Rangan, A. K. Fletcher, and V. K. Goyal, "Asymptotic analysis of map estimation via the replica method and applications to compressed sensing", in Neural Information Processing Systems (NIPS), Dec. 2009.