arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2401.06547cs.DS
收藏

我们是否仍然遗漏了一个元素?

Are We Still Missing an Item?

Roey Magen

AI总结:

本文研究缺失元素问题,在长流静态设置下证明了 polylog(n) 内存足以在流长接近 n 时识别缺失元素,并在流长超过 n 时给出 Θ(k) 紧界;在对抗鲁棒设置下为伪确定性零误差算法和随机启动零误差流式算法分别建立了 Ω(ℓ) 下界和 Θ(√ℓ) 紧界。

摘要:

缺失元素问题由 Stoeckl 在 SODA 23 的工作中提出,其核心是在来自集合 $\{1,2,...,n\}$ 的元素流 $\{e_1, ..., e_{\ell}\}$ 中持续识别一个缺失元素 $e$,使得对于任意 $i \in \{1,...,\ell\}$,都有 $e \neq e_i$。Stoeckl 的研究主要深入探讨了 $\ell<n$ 的场景,为以下三种情况提供了界:(i)确定性情况,(ii)静态情况——算法可以是随机的,但流是预先固定的,以及(iii)对抗鲁棒情况——算法是随机的,且每个流元素可以根据算法先前的输出进行选择。在此基础上,本文解决了缺失元素问题中此前未被探索的方面。\n在第一部分中,我们研究了长流下的静态设置,其中流的长度 $\ell$ 接近甚至超过全集大小 $n$。我们提出了一种算法,证明即使当 $\ell$ 非常接近 $n$(例如 $\ell=n-1$)时,polylog($n$) 比特的内存也足以识别缺失元素。当流的长度 $\ell$ 超过全集大小 $n$,即 $\ell = n +k$ 时,我们给出了大约 $Θ(k)$ 的紧界。\n第二部分聚焦于对抗鲁棒设置。我们证明了一个伪确定性零误差(算法会报告其错误)算法的下界,其近似为 $Ω(\ell)$,最多相差 polylog 因子。基于 Stoeckl 的工作和前述结果,我们为随机启动(仅在初始化时使用随机性)的零误差流式算法建立了一个大约 $Θ(\sqrt{\ell})$ 的紧界。

英文摘要:

The missing item problem, as introduced by Stoeckl in his work at SODA 23, focuses on continually identifying a missing element $e$ in a stream of elements ${e_1, ..., e_{\ell}}$ from the set $\{1,2,...,n\}$, such that $e \neq e_i$ for any $i \in \{1,...,\ell\}$. Stoeckl's investigation primarily delves into scenarios with $\ell<n$, providing bounds for the (i) deterministic case, (ii) the static case -- where the algorithm might be randomized but the stream is fixed in advanced and (iii) the adversarially robust case -- where the algorithm is randomized and each stream element can be chosen depending on earlier algorithm outputs. Building upon this foundation, our paper addresses previously unexplored aspects of the missing item problem. In the first segment, we examine the static setting with a long stream, where the length of the steam $\ell$ is close to or even exceeds the size of the universe $n$. We present an algorithm demonstrating that even when $\ell$ is very close to $n$ (say $\ell=n-1$), polylog($n$) bits of memory suffice to identify the missing item. When the stream's length $\ell$ exceeds the size of the universe $n$ i.e. $\ell = n +k$, we show a tight bound of roughly $Θ(k)$. The second segment focuses on the adversarially robust setting. We show a lower bound for a pseudo-deterministic error-zero (where the algorithm reports its errors) algorithm of approximating $Ω(\ell)$, up to polylog factors. Based on Stoeckl's work and the previous result, we establish a tight bound for a random-start (only use randomness at initialization) error-zero streaming algorithm of roughly $Θ(\sqrt{\ell})$.

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

↑