泛关系的最优下界,以及采样器和在流中查找重复的最优下界
Optimal lower bounds for universal relation, and for samplers and finding duplicates in streams
摘要:
在通信问题$\mathbf{UR}$(通用关系)[KRW 95]中,Alice和Bob分别接收$x, y \in\{0,1\}^n$,并承诺$x\neq y$。最后一个收到消息的玩家必须输出一个索引$i$,使得$x_i\neq y_i$。我们证明了在公共硬币模型中,该问题的随机单向通信复杂度对于失效概率$δ$恰好是$Θ(\min\{n,\log(1/δ)\log^2(\frac n{\log(1/δ)})\})$。即使承诺了$\mathop{support}(y)\subset \mathop{support}(x)$,我们的下界也成立。作为一个推论,我们获得了最佳的下限$\ell_p$采样严格的旋转栅门流$0\le p < 2$,以及在流中找到重复的问题。我们的下界不需要使用大的权重,并且即使在流中的所有点上都承诺了$x\in\{0,1\}^n$,它也是成立的。对主要结果给出了两种不同的证明。第一个证明表明,任何算法$\mathcal A$解决采样问题,在旋转栅门流在低内存可以被用来编码成一定大小的$[n]$的子集的位数低于信息理论的最小值。我们的编码器在整个执行过程中对$\mathcal A$进行自适应查询,但要小心,以免违反正确性。这是通过将随机噪声注入到编码器与$\mathcal A$的交互中来实现的,这是由差分隐私技术松散地激励的。我们的第二个证明是通过一个新的随机减少从增强索引[MNSW 98],需要与$\mathcal A$自适应地相互作用。为了处理自适应性,我们确定了某些可能的交互模式,并在它们之上绑定联合,以保证所有这些模式上的正确交互。为了保证正确性,重要的是,在约简中,交互作用对$\mathcal A$隐藏了一些随机性。
英文摘要:
In the communication problem $\mathbf{UR}$ (universal relation) [KRW95], Alice and Bob respectively receive $x, y \in\{0,1\}^n$ with the promise that $x\neq y$. The last player to receive a message must output an index $i$ such that $x_i\neq y_i$. We prove that the randomized one-way communication complexity of this problem in the public coin model is exactly $Θ(\min\{n,\log(1/δ)\log^2(\frac n{\log(1/δ)})\})$ for failure probability $δ$. Our lower bound holds even if promised $\mathop{support}(y)\subset \mathop{support}(x)$. As a corollary, we obtain optimal lower bounds for $\ell_p$-sampling in strict turnstile streams for $0\le p < 2$, as well as for the problem of finding duplicates in a stream. Our lower bounds do not need to use large weights, and hold even if promised $x\in\{0,1\}^n$ at all points in the stream. We give two different proofs of our main result. The first proof demonstrates that any algorithm $\mathcal A$ solving sampling problems in turnstile streams in low memory can be used to encode subsets of $[n]$ of certain sizes into a number of bits below the information theoretic minimum. Our encoder makes adaptive queries to $\mathcal A$ throughout its execution, but done carefully so as to not violate correctness. This is accomplished by injecting random noise into the encoder's interactions with $\mathcal A$, which is loosely motivated by techniques in differential privacy. Our second proof is via a novel randomized reduction from Augmented Indexing [MNSW98] which needs to interact with $\mathcal A$ adaptively. To handle the adaptivity we identify certain likely interaction patterns and union bound over them to guarantee correct interaction on all of them. To guarantee correctness, it is important that the interaction hides some of its randomness from $\mathcal A$ in the reduction.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。