Abstract
This paper considers compressed sensing matrices and neighborliness of a centrally symmetric convex polytope generated by vectors ±X 1,…,±X N ∈ℝn, (N≥n). We introduce a class of random sampling matrices and show that they satisfy a restricted isometry property with overwhelming probability. In particular, we prove that matrices with i.i.d. centered and variance 1 entries that satisfy uniformly a subexponential tail inequality possess the restricted isometry property with overwhelming probability. We show that such “sensing” matrices are valid for the exact reconstruction process of m-sparse vectors via ℓ 1 minimization with m≤Cn/log 2(cN/n). The class of sampling matrices we study includes the case of matrices with columns that are independent isotropic vectors with log-concave densities. We deduce that if K⊂ℝn is a convex body and X 1,…,X N ∈K are i.i.d. random vectors uniformly distributed on K, then, with overwhelming probability, the symmetric convex hull of these points is an m-centrally-neighborly polytope with m∼n/log 2(cN/n).
Similar content being viewed by others
References
Adamczak, R., Litvak, A.E., Pajor, A., Tomczak-Jaegermann, N.: Quantitative estimates of the convergence of the empirical covariance matrix in log-concave ensembles. J. Am. Math. Soc. 234, 535–561 (2010)
Baraniuk, R., Davenport, M., DeVore, R., Wakin, M.: A simple proof of the restricted isometry property for random matrices. Constr. Approx. 28, 253–263 (2008)
Barthe, F., Guédon, O., Mendelson, S., Naor, A.: A probabilistic approach to the geometry of the lpn ball. Ann. Probab. 33, 480–513 (2005)
Borell, C.: The Brunn-Minkowski inequality in Gauss space. Invent. Math. 30, 207–216 (1975)
Candes, E.: The restricted isometry property and its implications for compressed sensing. C. R. Acad. Sci. Paris, Ser. I 346, 589–592 (2008)
Candes, E., Romberg, J., Tao, T.: Stable signal recovery from incomplete and incurable measurements. Commun. Pure Appl. Math. 59(8), 1207–1223 (2006)
Candes, E., Tao, T.: Decoding by linear programming. IEEE Trans. Inf. Theory 51(12), 4203–4215 (2005)
Candes, E., Tao, T.: Near-optimal signal recovery from random projections: universal encoding strategies. IEEE Trans. Inf. Theory 52, 5406–5425 (2006)
Cohen, A., Dahmen, W., Devore, R.: Compressed sensing and k-term approximation. J. Am. Math. Soc. 22, 211–231 (2009)
Donoho, D.L.: Neighborly polytopes and sparse solutions of underdetermined linear equations, Department of Statistics, Stanford University (2005)
Donoho, D.L.: Compressed sensing. IEEE Trans. Inf. Theory 52, 1289–1306 (2006)
Donoho, D.L.: High-dimensional centrally-symmetric polytopes with neighborliness proportional to dimension. Discrete Comput. Geom. 35, 617–652 (2006)
Donoho, D.L., Tanner, J.: Counting faces of randomly projected polytopes when the projection radically lowers dimension. J. Am. Math. Soc. 22, 1–53 (2009)
Fleury, B., Guédon, O., Paouris, G.: A stability result for mean width of L p -centroid bodies. Adv. Math. 214, 865–877 (2007)
Grünbaum, B.: Convex Polytopes, 2nd edn. Graduate Texts in Mathematics, vol. 221. Springer, New York (2003)
Hitczenko, P., Montgomery-Smith, S.J., Oleszkiewicz, K.: Moment inequalities for sums of certain independent symmetric random variables. Stud. Math. 123, 15–42 (1997)
Kashin, B.S., Temlyakov, V.N.: A remark on compressed sensing. Math. Not. 82, 748–755 (2007)
Klartag, B.: Power-law estimates for the central limit theorem for convex sets. J. Funct. Anal. 245, 284–310 (2007)
Klartag, B.: A central limit theorem for convex sets. Invent. Math. 168, 91–131 (2007)
Latała, R.: Tail and moment estimates for sums of independent random vectors with logarithmically concave tails. Stud. Math. 118, 301–304 (1996)
Linial, N., Novik, I.: How neighborly can a centrally symmetric polytope be? Discrete Comput. Geom. 36, 273–281 (2006)
Mankiewicz, P., Tomczak-Jaegermann, N.: Stability properties of neighborly random polytopes. Discrete Comput. Geom. 41, 257–272 (2009)
Mendelson, S., Pajor, A., Tomczak-Jaegermann, N.: Reconstruction and sub-gaussian processes. C. R. Acad. Sci. Paris 340, 885–888 (2005)
Mendelson, S., Pajor, A., Tomczak-Jaegermann, N.: Reconstruction and sub-gaussian operators. Geom. Funct. Anal. 17, 1248–1282 (2007)
Mendelson, S., Pajor, A., Tomczak-Jaegermann, N.: Uniform uncertainty principle for Bernoulli and sub-gaussian ensembles. Constr. Approx. 28, 277–289 (2008)
Paouris, G.: Concentration of mass on convex bodies. Geom. Funct. Anal. 16, 1021–1049 (2006)
Rudelson, M., Vershynin, R.: Geometric approach to error correcting codes and reconstruction of signals. Int. Math. Res. Not. 64, 4019–4041 (2005)
Talagrand, M.: The Generic Chaining. Upper and Lower Bounds of Stochastic Processes. Springer Monographs in Mathematics. Springer, Berlin (2005)
Talagrand, M.: The supremum of some canonical processes. Am. J. Math. 116, 283–325 (1994)
van der Vaart, A.W., Wellner, J.A.: Weak Convergence and Empirical Processes. With Applications to Statistics. Springer Series in Statistics. Springer, New York (1996)
Ziegler, G.: Lectures on Polytopes. Graduate Texts in Mathematics, vol. 152. Springer, New York (1995)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by Emmanuel J. Candes.
The research of R. Adamczak was partially supported by the Foundation for Polish Science.
N. Tomczak-Jaegermann holds the Canada Research Chair in Geometric Analysis.
Rights and permissions
About this article
Cite this article
Adamczak, R., Litvak, A.E., Pajor, A. et al. Restricted Isometry Property of Matrices with Independent Columns and Neighborly Polytopes by Random Sampling. Constr Approx 34, 61–88 (2011). https://doi.org/10.1007/s00365-010-9117-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00365-010-9117-4
Keywords
- Centrally-neighborly polytopes
- Compressed sensing
- Random matrices
- Restricted isometry property
- Underdetermined systems of linear equations