We present a randomized method to approximate any vector from some set $T \subset \R^nTk(\inr{X_i,v}){i=1}^k(X_i){i=1}^k$ are i.i.d. isotropic subgaussian random vectors in , and . We show that with high probability, any for which is close to the data vector will be a good approximation of , and that the degree of approximation is determined by a natural geometric parameter associated with the set . We also investigate a random method to identify exactly any vector which has a relatively short support using linear subgaussian measurements as above. It turns out that our analysis, when applied to -valued vectors with i.i.d, symmetric entries, yields new information on the geometry of faces of random -polytope; we show that a -dimensional random -polytope with vertices is -neighborly for very large $m\le {ck/\log (c’ n/k)}$. The proofs are based on new estimates on the behavior of the empirical process when is a subset of the sphere. The estimates are given in terms of the functional with respect to the metric on , and hold both in exponential probability and in expectation.

生成讲解博客的中文版本

生成AI智能校验的中文版本