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

近似计数的最优界

Optimal bounds for approximate counting

Jelani Nelson, Huacheng Yu

摘要:

存储计数器递增的$N$次数将消耗$O(\log N)$位的内存。1978年,莫里斯描述了第一个流算法:“莫里斯计数器”。他的算法的空间边界是一个随机变量,并且已经证明它是$O(\log\log N + \log(1/\varepsilon) + \log(1/δ))$位,期望提供一个概率为$1-δ$的$(1+\varepsilon)$ -近似到计数器的值。我们提供了一个新的简单的算法,一个简单的分析表明,随机空间$O(\log\log N + \log(1/\varepsilon) + \log\log(1/δ))$位足够的相同的任务,即指数改善的依赖性的逆故障概率。然后,我们提供了一个新的分析表明,原来的莫里斯计数器本身,经过一个轻微的,但必要的调整,实际上也享有同样的改进上限。最后,我们证明了一个新的下界,显示我们的上限的最优性。因此,我们完全解决了近似计数的渐近空间复杂度。此外,我们所有的常数是明确的,我们的下限和最严格的上限相差最多$3+o(1)$的乘法因子。

英文摘要:

Storing a counter incremented $N$ times would naively consume $O(\log N)$ bits of memory. In 1978 Morris described the very first streaming algorithm: the "Morris Counter". His algorithm's space bound is a random variable, and it has been shown to be $O(\log\log N + \log(1/\varepsilon) + \log(1/δ))$ bits in expectation to provide a $(1+\varepsilon)$-approximation with probability $1-δ$ to the counter's value. We provide a new simple algorithm with a simple analysis showing that randomized space $O(\log\log N + \log(1/\varepsilon) + \log\log(1/δ))$ bits suffice for the same task, i.e. an exponentially improved dependence on the inverse failure probability. We then provide a new analysis showing that the original Morris Counter itself, after a minor but necessary tweak, actually also enjoys this same improved upper bound. Lastly, we prove a new lower bound for this task showing optimality of our upper bound. We thus completely resolve the asymptotic space complexity of approximate counting. Furthermore all our constants are explicit, and our lower bound and tightest upper bound differ by a multiplicative factor of at most $3+o(1)$.

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

↑