用于行/列子集选择的高效体积采样
Efficient volume sampling for row/column subset selection
摘要:
我们给出了有效的算法体积采样,即,用于挑选$k$ -任何给定矩阵的行的子集,其概率与由它们和原点定义的单形的平方体积(或由这些行的子集定义的平行六面体的平方体积)成比例。这解决了一个开放的问题,从专着的频谱算法的Kannan和Vempala。我们的用于体积采样$k$的第一算法-来自$m$ × $n$矩阵的行的子集在$O(kmn^ω \log n)$算术运算中运行,并且其用于$(1+ε)$的第二变体-近似体积采样在$O(mn \log m \cdot k^{2}/ε^{2} + m \log^ω m \cdot k^{2ω+1}/ε^{2ω} \cdot \log(k ε^{-1} \log m))$算术运算中运行,其在输入的大小上几乎是线性的(即,条目数)。我们高效的体积采样算法意味着低秩矩阵近似几个有趣的结果。
英文摘要:
We give efficient algorithms for volume sampling, i.e., for picking $k$-subsets of the rows of any given matrix with probabilities proportional to the squared volumes of the simplices defined by them and the origin (or the squared volumes of the parallelepipeds defined by these subsets of rows). This solves an open problem from the monograph on spectral algorithms by Kannan and Vempala. Our first algorithm for volume sampling $k$-subsets of rows from an $m$-by-$n$ matrix runs in $O(kmn^ω \log n)$ arithmetic operations and a second variant of it for $(1+ε)$-approximate volume sampling runs in $O(mn \log m \cdot k^{2}/ε^{2} + m \log^ω m \cdot k^{2ω+1}/ε^{2ω} \cdot \log(k ε^{-1} \log m))$ arithmetic operations, which is almost linear in the size of the input (i.e., the number of entries) for small $k$. Our efficient volume sampling algorithms imply several interesting results for low-rank matrix approximation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。