Restricted eigenvalue properties for correlated Gaussian designs

Journal of Machine Learning Research

Volumn 11, Issue , 2010, Pages 2241-2259

  Raskutti, Garvesh ^a   Wainwright, Martin J ^a,b   Yu, Bin ^a,b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b Computer Science ^*  (United States)

Author keywords

Basis pursuit; Concentration of measure; Gaussian comparison inequality; Lasso; Random matrix theory

Indexed keywords

BASIS PURSUITS; CONCENTRATION OF MEASURE; GAUSSIANS; LASSO; RANDOM MATRIX THEORY;

DESIGN; GAUSSIAN DISTRIBUTION; MATRIX ALGEBRA; OPTICAL COMMUNICATION;

EIGENVALUES AND EIGENFUNCTIONS;

EID: 77956925453     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (34)

1. R. Adamczak, A. Litvak, N. Tomczak-Jaegermann, and A. Pajor. Restricted isometry property of matrices with independent columns and neighborly polytopes by random sampling. Technical report, University of Alberta, 2009.
2. K. S. Alexander. Rates of growth for weighted empirical processes. In Proceedings of the Berkeley Conference in Honor of Jerzy Neyman and Jack Kiefer, pages 475-493. UC Press, Berkeley, 1985.
3. P. Bickel, Y. Ritov, and A. Tsybakov. Simultaneous analysis of lasso and dantzig selector. Annals of Statistics, 37(4):1705-1732, 2009.
4. F. Bunea, A. Tsybakov, and M. Wegkamp. Sparsity oracle inequalities for the Lasso. Electronic Journal of Statistics, pages 169-194, 2007.
5. E. Candes and T. Tao. Decoding by linear programming. IEEE Trans. Info Theory, 51(12):4203-4215, December 2005.
6. E. Candes and T. Tao. The Dantzig selector: Statistical estimation when p is much larger than n. Annals of Statistics, 35(6):2313-2351, 2007.
7. S. Chen, D. L. Donoho, and M. A. Saunders. Atomic decomposition by basis pursuit. SIAMJ. Sci. Computing, 20(1):33-61, 1998.
8. A. Cohen, W. Dahmen, and R. DeVore. Compressed sensing and best k-term approximation. J. of. American Mathematical Society, 22(1):211-231, January 2009.
9. K. R. Davidson and S. J. Szarek. Local operator theory, random matrices, and Banach spaces. In Handbook of Banach Spaces, volume 1, pages 317-336. Elsevier, Amsterdan, NL, 2001.
10. D. Donoho. Compressed sensing. IEEE Trans. Info. Theory, 52(4):1289-1306, April 2006.
11. D. Donoho and X. Huo. Uncertainty principles and ideal atomic decomposition. IEEE Trans. Info Theory, 47(7):2845-2862, 2001.
12. 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.
13. A. Feuer and A. Nemirovski. On sparse representation in pairs of bases. IEEE Trans. Info Theory, 49(6):1579-1581, 2003.
14. Y. Gordon. Some inequalities for Gaussian processes and applications. Israel Journal of Mathematics, 50(4):265-289, 1985.
15. R. M. Gray. Toeplitz and Circulant Matrices: A Review. Technical report, Stanford University, Information Systems Laboratory, 1990.
16. O. Guédon, S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann. Subspaces and orthogonal decompositions generated by bounded orthogonal systems. Journal of Positivity, 11(2):269-283, 2007.
17. O. Guédon, S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann. Majorizing measures and proportional subsets of bounded orthonormal systems. Journal of Rev. Mat. Iberoam, 24(3):1075-1095, 2008.
18. J. Haupt, W. U. Bajwa, G. Raz, and R. Nowak. Toeplitz compressed sensing matrices with applications to sparse channel estimation. Technical report, University of Wisconsin-Madison, 2010.
19. R. A. Horn and C. R. Johnson. Matrix Analysis. Cambridge University Press, Cambridge, 1985.
20. M. Ledoux. The Concentration of Measure Phenomenon. Mathematical Surveys and Monographs. American Mathematical Society, Providence, RI, 2001.
21. M. Ledoux and M. Talagrand. Probability in Banach Spaces: Isoperimetry and Processes. Springer-Verlag, New York, NY, 1991.
22. P. Massart. Concentration Inequalties and Model Selection. Ecole d'Eté de Probabilités, Saint-Flour. Springer, New York, 2003.
23. N. Meinshausen and B. Yu. Lasso-type recovery of sparse representations for high-dimensional data. Annals of Statistics, 37(1):246-270, 2009.
24. S. Mendelson, A. Pajor, and N. Tomczak-Jaegermann. Uniform uncertainty principle for bernoulli and subgaussian ensembles. Journal of Constr. Approx., 28(3):277-289, 2008.
25. S. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu. A unified framework for highdimensional analysis of M-estimators with decomposable regularizes. In Proceedings of NIPS, December 2009.
26. q-balls. Technical report, U. C. Berkeley, October 2009. Posted as http://arxiv.org/abs/0910.2042.
27. Justin Romberg. Compressive sensing by random convolution. SIAM Journal of Imaging Science, 2(4):1098-1128, 2009.
28. M. Rudelson and R. Vershynin. On sparse reconstruction from fourier and gaussian measurements. Comm. Pure and Appl. Math., 61(8):1025-1045, 2008.
29. R. Tibshirani. Regression shrinkage and selection via the Lasso. Journal of the Royal Statistical Society, Series B, 58(1):267-288, 1996.
30. S. van de Geer. Empirical Processes in M-Estimation. Cambridge University Press, 2000.
31. S. van de Geer. The deterministic lasso. In Proc. of Joint Statistical Meeting, 2007.
32. S. van de Geer and P. Buhlmann. On the conditions used to prove oracle results for the lasso. Electronic Journal of Statistics, 3:1360-1392, 2009.
33. C. H. Zhang and J. Huang. The sparsity and bias of the lasso selection in high-dimensional linear regression. Annals of Statistics, 36(4):1567-1594, 2008.
34. S. Zhou. Restricted eigenvalue conditions on subgaussian random matrices. Technical report, Department of Mathematics, ETH Zürich, December 2009.