Suprema of chaos processes and the restricted isometry property

Communications on Pure and Applied Mathematics

Volumn 67, Issue 11, 2014, Pages 1877-1904

  Krahmer, Felix ^a   Mendelson, Shahar ^b   Rauhut, Holger ^c  

^a UNIVERSITY OF GÖTTINGEN   (Germany)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84908338179     PISSN: 00103640     EISSN: 10970312     Source Type: Journal    
DOI: 10.1002/cpa.21504     Document Type: Article

References (48)

1. Arcones, M. A.; Giné, E. On decoupling, series expansions, and tail behavior of chaos processes. J. Theoret. Probab. 6 (1993), no. 1, 101-122. doi:10.1007/BF01046771
2. Bajwa, W. U.; Haupt, J.; Sayeed, A. M.; Nowak, R. Compressed channel sensing: a new approach to estimating sparse multipath channels. Proc. IEEE 98 (2010), no. 5, 1058-1076. doi:10.1109/JPROC.2010.2042415
3. Baraniuk, R.; Davenport, M.; DeVore, R.; Wakin, M. A simple proof of the restricted isometry property for random matrices. Constr. Approx. 28 (2008), no. 3, 253-263. doi:10.1007/s00365-007-9003-x
4. Blumensath, T.; Davies, M. E. Iterative hard thresholding for compressed sensing. Appl. Comput. Harmon. Anal. 27 (2009), no. 3, 265-274. doi:10.1016/j.acha.2009.04.002
5. Boucheron, S.; Lugosi, G.; Massart, P. Concentration inequalities using the entropy method. Ann. Probab. 31 (2003), no. 3, 1583-1614. doi:10.1214/aop/1055425791
6. Bourgain, J.; Tzafriri, L. Invertibility of "large" submatrices with applications to the geometry of Banach spaces and harmonic analysis. Israel J. Math. 57 (1987), no. 2, 137-224. doi:10.1007/BF02772174
7. Candés, E. J.; Romberg, J.; Tao, T. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information. IEEE Trans. Inform. Theory 52 (2006), no. 2, 489-509. doi:10.1109/TIT.2005.862083
8. Candés, E. J.; Romberg, J. K.; Tao, T. Stable signal recovery from incomplete and inaccurate measurements. Comm. Pure Appl. Math. 59 (2006), no. 8, 1207-1223. doi:10.1002/cpa.20124
9. Candes, E. J.; Tao, T. Near-optimal signal recovery from random projections: universal encoding strategies? IEEE Trans. Inform. Theory 52 (2006), no. 12, 5406-5425. doi:10.1109/TIT.2006.885507
10. Carl, B. Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces. Ann. Inst. Fourier (Grenoble) 35 (1985), no. 3, 79-118.
11. Chen, S. S.; Donoho, D. L.; Saunders, M. A. Atomic decomposition by basis pursuit. SIAM J. Sci. Comput. 20 (1998), no. 1, 33-61. doi:10.1137/S1064827596304010
12. de la Peña, V. H.; Giné, E. A. Decoupling: from dependence to independence. Springer, New York, 1999.
13. Donoho, D. L. Compressed sensing. IEEE Trans. Inform. Theory 52 (2006), no. 4, 1289-1306. doi:10.1109/TIT.2006.871582
14. Dudley, R. M. The sizes of compact subsets of Hilbert space and continuity of Gaussian processes. J. Functional Analysis 1 (1967), 290-330.
15. Dudley, R. M. Uniform central limit theorems. Cambridge Studies in Advanced Mathematics, 63. Cambridge University Press, Cambridge, 1999. doi:10.1017/CBO9780511665622
16. Feichtinger, H. G.; Luef, F.; Werther, T. A guided tour from linear algebra to the foundations of Gabor analysis. Gabor and wavelet frames, 1-49. Lecture Notes Series. Institute for Mathematical Sciences. National University of Singapore. World Scientific, Hackensack, N.J., 2007. doi:10.1142/9789812709080_0001
17. Fernique, X. Regularité des trajectoires des fonctions aléatoires gaussiennes. École d'Été de Probabilités de Saint-Flour, IV-1974, 1-96. Lecture Notes in Mathematics, 480. Springer, Berlin, 1975.
18. Fornasier, M.; Rauhut, H. Compressive sensing. Handbook of Mathematical Methods in Imaging, 187-228. Springer, New York, 2011. doi:10.1007/978-0-387-92920-0_6
19. Foucart, S. Hard thresholding pursuit: an algorithm for compressive sensing. SIAM J. Numer. Anal. 49 (2011), no. 6, 2543-2563. doi:10.1137/100806278
20. Foucart, S. Sparse recovery algorithms: sufficient conditions in terms of restricted isometry constants. Approximation Theory XIII: San Antonio 2010, 65-77. Springer, New York, 2012. doi:10.1007/978-1-4614-0772-0_5
21. Gröchenig, K. Foundations of time-frequency analysis. Applied and Numerical Harmonic Analysis. Birkhöuser Boston, Boston, 2001.
22. Haupt, J.; Bajwa, W.; Raz, G.; Nowak, R. Toeplitz compressed sensing matrices with applications to sparse channel estimation. IEEE Trans. Inform. Theory 56 (2010), no. 11, 5862-5875. doi:10.1109/TIT.2010.2070191
23. Herman, M.; Strohmer, T. High-resolution radar via compressed sensing. IEEE Trans. Signal Process. 57 (2009), no. 6, 2275-2284. doi:10.1109/TSP.2009.2014277
24. Hinrichs, A.; Vybíral, J. Johnson-Lindenstrauss lemma for circulant matrices. Random Structures Algorithms 39 (2011), no. 3, 391-398. doi:10.1002/rsa.20360
25. Krahmer, F.; Pfander, G. E.; Rashkov, P. Uncertainty in time-frequency representations on finite abelian groups and applications. Appl. Comput. Harmon. Anal. 25 (2008), no. 2, 209-225. doi:10.1016/j.acha.2007.09.008
26. Krahmer, F.; Ward, R. New and improved Johnson-Lindenstrauss embeddings via the restricted isometry property. SIAM J. Math. Anal. 43 (2011), no. 3, 1269-1281. doi:10.1137/100810447
27. Ledoux, M.; Talagrand, M. Probability in Banach spaces. Isoperimetry and processes. Ergebnisse der Mathematik und ihrer Grenzgebiete (3), 23. Springer, Berlin, 1991.
28. p (1 < p < ∞). C. R. Acad. Sci. Paris Sér. I Math. 303 (1986), no. 7, 289-292.
29. Lust-Piquard, F.; Pisier, G. Noncommutative Khintchine and Paley inequalities. Ark. Mat. 29 (1991), no. 2, 241-260. doi:10.1007/BF02384340
30. Mendelson, S.; Pajor, A.; Tomczak-Jaegermann, N. Reconstruction and subgaussian operators in asymptotic geometric analysis. Geom. Funct. Anal. 17 (2007), no. 4, 1248-1282. doi:10.1007/s00039-007-0618-7
31. 2k. Appl. Comput. Harmon. Anal. 31 (2011), no. 3, 460-468. doi:10.1016/j.acha.2011.04.005
32. Needell, D.; Tropp, J. A. CoSaMP: iterative signal recovery from incomplete and inaccurate samples. Appl. Comput. Harmon. Anal. 26 (2009), no. 3, 301-321. doi:10.1016/j.acha.2008.07.002
33. Pfander, G. E.; Rauhut, H. Sparsity in time-frequency representations. J. Fourier Anal. Appl. 16 (2010), no. 2, 233-260. doi:10.1007/s00041-009-9086-9
34. Pfander, G. E.; Rauhut, H.; Tanner, J. Identification of matrices having a sparse representation. IEEE Trans. Signal Process. 56 (2008), no. 11, 5376-5388. doi:10.1109/TSP.2008.928503
35. Pfander, G. E.; Rauhut, H.; Tropp, J. A. The restricted isometry property for time-frequency structured random matrices. Probab. Theory Relat. Fields 156 (2013), no. 3-4, 707-737. doi:10.1007/s00440-012-0441-4
36. Pisier, G. Some applications of the metric entropy condition to harmonic analysis. Banach spaces, harmonic analysis, and probability theory (Storrs, Conn., 1980/1981), 123-154. Lecture Notes in Mathematics, 995. Springer, Berlin, 1983. doi:10.1007/BFb0061891
37. Rauhut, H. Circulant and Toeplitz matrices in compressed sensing. Proc. SPARS'09 (Saint-Malo, France), 2009.
38. Rauhut, H. Compressive sensing and structured random matrices. Theoretical foundations and numerical methods for sparse recovery, 1-92. Radon Series on Computational and Applied Mathematics, 9. Walter de Gruyter, Berlin, 2010. doi:10.1515/9783110226157.1
39. Rauhut, H.; Romberg, J.; Tropp, J. A. Restricted isometries for partial random circulant matrices. Appl. Comput. Harmon. Anal. 32 (2012), no. 2, 242-254. doi:10.1016/j.acha.2011.05.001
40. Romberg, J. Compressive sensing by random convolution. SIAM J. Imaging Sci. 2 (2009), no. 4, 1098-1128. doi:10.1137/08072975X
41. Rudelson, M. Random vectors in the isotropic position. J. Funct. Anal. 164 (1999), no. 1, 60-72. doi:10.1006/jfan.1998.3384
42. Rudelson, M.; Vershynin, R. On sparse reconstruction from Fourier and Gaussian measurements. Comm. Pure Appl. Math. 61 (2008), no. 8, 1025-1045. doi:10.1002/cpa.20227
43. Talagrand, M. Regularity of Gaussian processes. Acta Math. 159 (1987), no. 1-2, 99-149. doi:10.1007/BF02392556
44. Talagrand, M. New concentration inequalities in product spaces. Invent. Math. 126 (1996), no. 3, 505-563. doi:10.1007/s002220050108
45. Talagrand, M. The generic chaining. Springer Monographs in Mathematics. Springer, Berlin, 2005.
46. Vershynin, R. Introduction to the non-asymptotic analysis of random matrices. Compressed sensing, 210-268. Cambridge University Press, Cambridge, 2012.
47. Vybíral, J. A variant of the Johnson-Lindenstrauss lemma for circulant matrices. J. Funct. Anal. 260 (2011), no. 4, 1096-1105. doi:10.1016/j.jfa.2010.11.014
48. Zhang, T. Sparse recovery with orthogonal matching pursuit under RIP. IEEE Trans. Inform. Theory 57 (2011), no. 9, 6215-6221. doi:10.1109/TIT.2011.2162263