arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2110.14948cs.DSmath.PRmath.STstat.TH
收藏

基于加权抽样的和估计

Better Sum Estimation via Weighted Sampling

Lorenzo Beretta, Jakub Tětek

摘要:

给定一个大集合$U$,其中每个项目$a\in U$具有权重$w(a)$,我们希望以某个恒定概率$>1/2$估计总权重$W=\sum_{a\in U} w(a)$在$1\pm\varepsilon$的因子内。由于$n=|U|$很大,我们不想查看整个$U$集。在传统的设置中,我们被允许从$U$中均匀地采样元素,采样$Ω(n)$项是必要的,以提供任何非平凡的估计保证。因此,我们在不同的设置中研究这个问题:在\emph{proportional}设置中,我们可以以与权重成比例的概率对项目进行采样,而在\emph{hybrid}设置中,我们可以按比例和均匀地进行采样。这些设置有应用,例如,在次线性时间算法和分布测试。Motwani、Panigrahy和Xu之前已经考虑过比例和混合设置中的和估计[ICALP,2007]。在他们的论文中,他们给出了$n$的上下界。它们的边界在$n$方面接近匹配,但在$\varepsilon$方面不匹配。在本文中,我们改进了它们的上界和下界。我们的边界在两种设置下都匹配到常数因子,即$n$和$\varepsilon$。以前不知道依赖于$\varepsilon$的下限。在比例设置中,我们将他们的$\tilde{O}(\sqrt{n}/\varepsilon^{7/2})$算法改进为$O(\sqrt{n}/\varepsilon)$。在混合设置中,我们将$\tilde{O}(\sqrt[3]{n}/ \varepsilon^{9/2})$改进为$O(\sqrt[3]{n}/\varepsilon^{4/3})$。我们的算法也显着简单,没有大的常数因子。我们还调查了以前未探索的设置$n$是未知的算法。最后,我们将展示我们的技术如何适用于图中的边计数问题。

英文摘要:

Given a large set $U$ where each item $a\in U$ has weight $w(a)$, we want to estimate the total weight $W=\sum_{a\in U} w(a)$ to within factor of $1\pm\varepsilon$ with some constant probability $>1/2$. Since $n=|U|$ is large, we want to do this without looking at the entire set $U$. In the traditional setting in which we are allowed to sample elements from $U$ uniformly, sampling $Ω(n)$ items is necessary to provide any non-trivial guarantee on the estimate. Therefore, we investigate this problem in different settings: in the \emph{proportional} setting we can sample items with probabilities proportional to their weights, and in the \emph{hybrid} setting we can sample both proportionally and uniformly. These settings have applications, for example, in sublinear-time algorithms and distribution testing. Sum estimation in the proportional and hybrid setting has been considered before by Motwani, Panigrahy, and Xu [ICALP, 2007]. In their paper, they give both upper and lower bounds in terms of $n$. Their bounds are near-matching in terms of $n$, but not in terms of $\varepsilon$. In this paper, we improve both their upper and lower bounds. Our bounds are matching up to constant factors in both settings, in terms of both $n$ and $\varepsilon$. No lower bounds with dependency on $\varepsilon$ were known previously. In the proportional setting, we improve their $\tilde{O}(\sqrt{n}/\varepsilon^{7/2})$ algorithm to $O(\sqrt{n}/\varepsilon)$. In the hybrid setting, we improve $\tilde{O}(\sqrt[3]{n}/ \varepsilon^{9/2})$ to $O(\sqrt[3]{n}/\varepsilon^{4/3})$. Our algorithms are also significantly simpler and do not have large constant factors. We also investigate the previously unexplored setting where $n$ is unknown to the algorithm. Finally, we show how our techniques apply to the problem of edge counting in graphs.

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

↑