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].
Matrix Multiplication and Binary Space Partitioning Trees : An Exploration
在这里,我们探讨了一个双树算法的矩阵乘法的$A\in \mathbb{R}^{M\times D}$和$B\in\mathbb{R}^{D\times N}$,非常狭窄的有效性,如果规范化的行的$A$和列的$B$,作为$\mathbb{R}^{D}$中的向量,落入集群的顺序成比例的$Ω(D^τ)$与半径小于$\arcsin(ε/\sqrt{2})$的表面上的单位$D$ -球。该算法利用必要的修剪规则,以保证$ε$精度与结果矩阵中的向量幅度乘积成比例。\textit{ Unfortunately, if the rows and columns are uniformly distributed on the surface of the unit $D$-ball, then the expected points per required cluster approaches zero exponentially fast in $D$; thus, the approach requires a great deal of work to pass muster.}
Graduate School of Informatics, Kyoto University(京都大学信息科学研究科);Institute of Informatics, University of Warsaw(华沙大学信息学研究所);Department of Computer Science, Lund University(隆德大学计算机科学系);Department of Computer Science and Media Technology, Malmö University(马尔默大学计算机科学与媒体技术系)
Diagonal Packing for Efficient Homomorphic Sparse Matrix-Vector Multiplication
Faculty of Engineering and Natural Sciences, Sabancı University(萨班哲大学工程与自然科学学院);VERIM, Center of Excellence in Data Analytics, Sabancı University(萨班哲大学VERIM数据分析卓越中心)