基于非交换Bernstein界的矩阵算法行抽样
Row Sampling for Matrix Algorithms via a Non-Commutative Bernstein Bound
摘要:
我们专注于使用\emph{row sampling}的近似矩阵算法。我们给出了矩阵乘法、稀疏矩阵重构和\math{\ell_2}回归的应用。对于表示\math{d\ll m}维中的\math{m}点的矩阵\math{\matA\in\R^{m\times d}},所有这些任务都可以通过奇异值分解(SVD)在\math{O(md^2)}中实现。对于适当的行抽样概率(通常取决于\math{\matA}(\emph{leverage scores})的\math{m\times d}左奇异矩阵的行的范数),我们给出了行抽样算法与线性(多对数因子)依赖于\math{\matA}的稳定秩。这个结果是通过应用非交换的伯恩斯坦界来实现的。然后,我们给,据我们所知,第一算法计算近似适当的行采样概率,而不通过SVD的\math{\matA}。因此,这些是第一个\math{o(md^2)}算法,用于基于行采样的近似矩阵算法,使用杠杆分数作为采样概率。我们使用的技术来近似抽样根据杠杆分数使用一些强大的随机预测嵌入理论的最新成果,可能是一些独立的利益。我们承认,一个可以执行所有这些矩阵任务更有效地使用这些相同的随机投影方法,但由此产生的算法是在一个小数目的线性组合的所有行。在许多应用中,\math{\matA}的实际行具有某些物理意义,因此基于少量实际行的方法是令人感兴趣的。
英文摘要:
We focus the use of \emph{row sampling} for approximating matrix algorithms. We give applications to matrix multipication; sparse matrix reconstruction; and, \math{\ell_2} regression. For a matrix \math{\matA\in\R^{m\times d}} which represents \math{m} points in \math{d\ll m} dimensions, all of these tasks can be achieved in \math{O(md^2)} via the singular value decomposition (SVD). For appropriate row-sampling probabilities (which typically depend on the norms of the rows of the \math{m\times d} left singular matrix of \math{\matA} (the \emph{leverage scores}), we give row-sampling algorithms with linear (up to polylog factors) dependence on the stable rank of \math{\matA}. This result is achieved through the application of non-commutative Bernstein bounds. We then give, to our knowledge, the first algorithms for computing approximations to the appropriate row-sampling probabilities without going through the SVD of \math{\matA}. Thus, these are the first \math{o(md^2)} algorithms for row-sampling based approximations to the matrix algorithms which use leverage scores as the sampling probabilities. The techniques we use to approximate sampling according to the leverage scores uses some powerful recent results in the theory of random projections for embedding, and may be of some independent interest. We confess that one may perform all these matrix tasks more efficiently using these same random projection methods, however the resulting algorithms are in terms of a small number of linear combinations of all the rows. In many applications, the actual rows of \math{\matA} have some physical meaning and so methods based on a small number of the actual rows are of interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。