arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1211.0986cs.DScs.ITmath.ITmath.PR
收藏

具有快速乘法和较少行的RIP矩阵的新构造

New constructions of RIP matrices with fast multiplication and fewer rows

Jelani Nelson, Eric Price, Mary Wootters

摘要:

在压缩感知中,“受限等距属性”(RIP)是从m个线性测量值Φ x有效重构C^d中的近k稀疏向量x的充分条件。期望m较小,并且Φ支持快速矩阵-向量乘法。本文给出了C^{mxd}中RIP矩阵Phi的一个随机构造,它保持了所有k-稀疏向量的L_2范数,其中矩阵与向量的乘积Phix可以在近似线性时间内计算.行数m大约为eps^{-2}klog dlog ^2(klog d)。先前对支持快速矩阵-向量乘法的RIP矩阵(例如采样离散傅立叶矩阵)的构造的分析要求m大大约一个log k因子。支持快速矩阵向量乘法对于重复乘以Φ或Φ ^* 的迭代恢复算法是有用的。此外,我们的结构,以及RIP矩阵和约翰逊-林登施特劳斯引理之间的联系[Krahmer-Ward,SIAM。J. Math. Anal. 2011年],意味着快速的约翰逊-林登施特劳斯嵌入与渐近更少的行比以前已知的。我们的方法是对以前结构的简单扭曲。我们不是选择嵌入矩阵的行是从一些更大的结构化矩阵(如离散傅立叶变换或随机循环矩阵)中采样的行,而是选择嵌入矩阵的每行是原始矩阵的少量行的线性组合,并将随机符号翻转作为系数。在我们的分析中的主要工具是最近在[Krahmer-Mendelson-Rauhut,arXiv:1207.0235]中某些类型的Rademacher混沌过程的上确界。

英文摘要:

In compressed sensing, the "restricted isometry property" (RIP) is a sufficient condition for the efficient reconstruction of a nearly k-sparse vector x in C^d from m linear measurements Phi x. It is desirable for m to be small, and for Phi to support fast matrix-vector multiplication. In this work, we give a randomized construction of RIP matrices Phi in C^{m x d}, preserving the L_2 norms of all k-sparse vectors with distortion 1+eps, where the matrix-vector multiply Phi x can be computed in nearly linear time. The number of rows m is on the order of eps^{-2}klog dlog^2(klog d). Previous analyses of constructions of RIP matrices supporting fast matrix-vector multiplies, such as the sampled discrete Fourier matrix, required m to be larger by roughly a log k factor. Supporting fast matrix-vector multiplication is useful for iterative recovery algorithms which repeatedly multiply by Phi or Phi^*. Furthermore, our construction, together with a connection between RIP matrices and the Johnson-Lindenstrauss lemma in [Krahmer-Ward, SIAM. J. Math. Anal. 2011], implies fast Johnson-Lindenstrauss embeddings with asymptotically fewer rows than previously known. Our approach is a simple twist on previous constructions. Rather than choosing the rows for the embedding matrix to be rows sampled from some larger structured matrix (such as the discrete Fourier transform or a random circulant matrix), we instead choose each row of the embedding matrix to be a linear combination of a small number of rows of the original matrix, with random sign flips as coefficients. The main tool in our analysis is a recent bound for the supremum of certain types of Rademacher chaos processes in [Krahmer-Mendelson-Rauhut, arXiv:1207.0235].

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑