Information-theoretic bounds on sparsity recovery in the high-dimensional and noisy setting

IEEE International Symposium on Information Theory - Proceedings

Volumn , Issue , 2007, Pages 961-965

  Wainwright, Martin ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

HIGH-DIMENSIONAL; INTERNATIONAL SYMPOSIUM;

CYBERNETICS;

INFORMATION THEORY;

EID: 51649127785     PISSN: 21578101     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISIT.2007.4557348     Document Type: Conference Paper

References (20)

1. E. Candes, J. Romberg, and T. Tao. Stable signal recovery from incomplete and inaccurate measurements. Communications on Pure and Applied Mathematics, 59(8): 1207-1223, August 2006.
2. E. Candes and T. Tao. Decoding by linear programming. IEEE Trans. Info Theory, 51(12):4203-4215, December 2005.
3. E. Candes and T. Tao. The Dantzig selector: Statistical estimation when p is much larger than n. Annals of Statistics, 2006.
4. S. Chen, D. L. Donoho, and M. A. Saunders. Atomic decomposition by basis pursuit. SIAM J. Sci. Computing, 20(1):33-61, 1998.
5. T.M. Cover and J.A. Thomas. Elements of Information Theory. John Wiley and Sons, New York, 1991.
6. D. Donoho. Compressed sensing. IEEE Trans. Info. Theory, 52(4): 1289-1306, April 2006.
7. 1-norm near-solution approximates the sparsest near-solution. Communications on Pure and Applied Mathematics, 59(7):907-934, July 2006.
8. 1-norm solution is also the sparsest solution. Communications on Pure and Applied Mathematics, 59(6):797-829, June 2006.
9. D. L. Donoho and J. M. Tanner. Counting faces of randomly-projected polytopes when the projection radically lowers dimension. Technical report, Stanford University, 2006. Submitted to Journal of the AMS.
10. M. Elad and A. M. Bruckstein. A generalized uncertainty principle and sparse representation in pairs of bases. IEEE Trans. Info Theory, 48(9):2558-2567, September 2002.
11. A. K. Fletcher, S. Rangan, and V. K. Goyal. Error bounds on sparse approximation. In ICASSP, April 2007.
12. I. A. Ibragimov and R. Z. Has'minskii. Statistical Estimation: Asymptotic Theory. Springer-Verlag, New York, 1981.
13. B. Laurent and R Massart. Adaptive estimation of a quadratic functional by model selection. Annals of Statistics, 28(5): 1303-1338, 1998.
14. D. M. Malioutov, M. Cetin, and A. S. Willsky. Optimal sparse representations in general overcomplete bases. In Int. Conf. on Acoustics, Speech, and Signal Processing, volume 2, pages 11-793-796, May 2004.
15. N. Meinshausen and R Buhlmann. High-dimensional graphs and variable selection with the lasso. Annals of Statistics, 2006. To appear.
16. R. Tibshirani. Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society, Series B, 58(l):267-288, 1996.
17. J. Tropp. Just relax: Convex programming methods for identifying sparse signals in noise. IEEE Trans. Info Theory, 52(3): 1030-1051, March 2006.
18. M. J. Wainwright. Information-theoretic bounds for sparsity recovery in the high-dimensional and noisy setting. Technical Report 725, Department of Statistics, UC Berkeley, January 2006. Posted as arxiv:math.ST/0702301.
19. 1 -constrained quadratic programs. In Proc. Allerton Conference on Communication, Control and Computing, October 2006. Long version appeared as UC Berkeley Technical Report 709.
20. R Zhao and B. Yu. Model selection with the lasso. Technical report, UC Berkeley, Department of Statistics, March 2006. Accepted to Journal of Machine Learning Research.