arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1109.3843cs.DScs.DMcs.LG
收藏

矩阵一致性和统计杠杆的快速近似

Fast approximation of matrix coherence and statistical leverage

Rensselaer Polytechnic Institute(伦斯勒理工学院);Stanford University(斯坦福大学);IBM Almaden Research Center(IBM阿尔马登研究中心)

Petros Drineas, Malik Magdon-Ismail, Michael W. Mahoney, David P. Woodruff

摘要:

矩阵$A$的统计杠杆分数是包含其(顶部)左奇异向量的矩阵的平方行范数,并且相干性是最大的杠杆分数。这些数量感兴趣的最近流行的问题,如矩阵完成和Nyström为基础的低秩矩阵近似,以及在大规模的统计数据分析应用程序更普遍;此外,他们的兴趣,因为他们定义的关键结构的非均匀性,必须处理在开发快速随机矩阵算法。我们的主要结果是一个随机算法,作为输入的任意$n \times d$矩阵$A$,与$n \gg d$,并返回作为输出的相对误差近似所有$n$的统计杠杆分数。所提出的算法在$O(n d \log n)$时间内运行(在$n$和$d$的精确值的假设下),与涉及计算$A$范围的正交基的朴素算法所需的$O(nd^2)$时间相反。我们的分析可以看作是计算一个欠约束的最小二乘近似问题的相对误差近似,或者,相关地,它可以被看作是一个应用程序的约翰逊-林登施特劳斯类型的想法。我们的基本结果的几个实际重要的扩展也被描述,包括所谓的交叉杠杆分数的近似,这些想法的扩展矩阵与$n \approx d$,和扩展到流媒体环境。

英文摘要:

The statistical leverage scores of a matrix $A$ are the squared row-norms of the matrix containing its (top) left singular vectors and the coherence is the largest leverage score. These quantities are of interest in recently-popular problems such as matrix completion and Nyström-based low-rank matrix approximation as well as in large-scale statistical data analysis applications more generally; moreover, they are of interest since they define the key structural nonuniformity that must be dealt with in developing fast randomized matrix algorithms. Our main result is a randomized algorithm that takes as input an arbitrary $n \times d$ matrix $A$, with $n \gg d$, and that returns as output relative-error approximations to all $n$ of the statistical leverage scores. The proposed algorithm runs (under assumptions on the precise values of $n$ and $d$) in $O(n d \log n)$ time, as opposed to the $O(nd^2)$ time required by the naïve algorithm that involves computing an orthogonal basis for the range of $A$. Our analysis may be viewed in terms of computing a relative-error approximation to an underconstrained least-squares approximation problem, or, relatedly, it may be viewed as an application of Johnson-Lindenstrauss type ideas. Several practically-important extensions of our basic result are also described, including the approximation of so-called cross-leverage scores, the extension of these ideas to matrices with $n \approx d$, and the extension to streaming environments.

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

↑