加载中…
We present a new bound for suprema of a special type of chaos processes indexed by a set of matrices, which is based on a chaining method. As applications we show significantly improved estimates for the restricted isometry constants of partial random circulant matrices and time-frequency structured random matrices. In both cases the required condition on the number of rows in terms of the sparsity and the vector length is $m \gtrsim s \log^2 s \log^2 n$.

生成讲解博客的中文版本

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