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

Zipfian分布下的(学习)频率估计算法

(Learned) Frequency Estimation Algorithms under Zipfian Distribution

Anders Aamand, Piotr Indyk, Ali Vakilian

摘要:

数据流中元素的频率是一个重要的统计度量,估计它们的任务出现在数据分析和机器学习的许多应用中。该问题的两个最流行的算法,Count-Min和Count-Sketch,在实践中被广泛使用。在最近的工作[Hsu等人,ICLR'19],经验表明,用机器学习算法扩充Count-Min和Count-Sketch导致估计误差的显著减小。实验的补充与Count-Min(标准和增强版本)的输入频率遵循Zipfian分布时所产生的预期误差的分析。虽然作者确定了Count-Min的学习版本比标准版本具有更低的估计误差,但他们对标准Count-Min算法的分析并不严格。此外,他们没有对Count-Sketch进行类似的分析。在本文中,我们解决这些问题。首先,我们提供了一个简单的紧密的分析所产生的预期误差的计数最小值。其次,我们提供了第一个误差界的标准和增强版本的计数草图。这些边界几乎是紧的,并再次证明了学习版本的Count-Sketch的性能有所改善。除了证明上述算法之间的紧密差距外,我们认为我们对Count-Min和Count-Sketch标准版本的界限是独立的。特别地,将那些算法中的散列函数的数量设置为$Θ(\log n)$是典型的实践。相反,我们的结果表明,为了最小化\emph{expected}错误,哈希函数的数量应该是一个常数,严格大于$1$。

英文摘要:

\begin{abstract} The frequencies of the elements in a data stream are an important statistical measure and the task of estimating them arises in many applications within data analysis and machine learning. Two of the most popular algorithms for this problem, Count-Min and Count-Sketch, are widely used in practice. In a recent work [Hsu et al., ICLR'19], it was shown empirically that augmenting Count-Min and Count-Sketch with a machine learning algorithm leads to a significant reduction of the estimation error. The experiments were complemented with an analysis of the expected error incurred by Count-Min (both the standard and the augmented version) when the input frequencies follow a Zipfian distribution. Although the authors established that the learned version of Count-Min has lower estimation error than its standard counterpart, their analysis of the standard Count-Min algorithm was not tight. Moreover, they provided no similar analysis for Count-Sketch. In this paper we resolve these problems. First, we provide a simple tight analysis of the expected error incurred by Count-Min. Second, we provide the first error bounds for both the standard and the augmented version of Count-Sketch. These bounds are nearly tight and again demonstrate an improved performance of the learned version of Count-Sketch. In addition to demonstrating tight gaps between the aforementioned algorithms, we believe that our bounds for the standard versions of Count-Min and Count-Sketch are of independent interest. In particular, it is a typical practice to set the number of hash functions in those algorithms to $Θ(\log n)$. In contrast, our results show that to minimize the \emph{expected} error, the number of hash functions should be a constant, strictly greater than $1$.

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

↑