矩阵乘积的分布统计估计及其应用
Distributed Statistical Estimation of Matrix Products with Applications
摘要:
我们考虑在分布式设置中整数上矩阵乘积的统计估计,其中我们有两个当事人Alice和Bob; Alice持有矩阵$A$,Bob持有矩阵$B$,并且他们想要估计$A \cdot B$的统计。我们专注于研究的$\ell_p$ -范数,不同的元素($p = 0$),$\ell_0$ -采样,和沉重的打击问题。目标是最小化通信成本和通信回合数。这个问题与数据库中的基本集交连接问题密切相关:当$p = 0$时,问题对应于集交连接的大小。当使用$p = \infty$时,输出只是具有最大交集大小的集合对。当使用$p = 1$时,问题对应于相应自然连接的大小。我们还考虑了重打击者问题,这对应于找到的对集的交集大小超过一定的阈值,和随机抽样的问题的交集对集均匀。
英文摘要:
We consider statistical estimations of a matrix product over the integers in a distributed setting, where we have two parties Alice and Bob; Alice holds a matrix $A$ and Bob holds a matrix $B$, and they want to estimate statistics of $A \cdot B$. We focus on the well-studied $\ell_p$-norm, distinct elements ($p = 0$), $\ell_0$-sampling, and heavy hitter problems. The goal is to minimize both the communication cost and the number of rounds of communication. This problem is closely related to the fundamental set-intersection join problem in databases: when $p = 0$ the problem corresponds to the size of the set-intersection join. When $p = \infty$ the output is simply the pair of sets with the maximum intersection size. When $p = 1$ the problem corresponds to the size of the corresponding natural join. We also consider the heavy hitters problem which corresponds to finding the pairs of sets with intersection size above a certain threshold, and the problem of sampling an intersecting pair of sets uniformly at random.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。