通信复杂性中的间隙多数引理
Gap-Majority Lemmas in Communication Complexity
AI总结:
研究在两人随机通信模型中证明间隙多数引理,表明计算$f$的信息需求与计算$\mathsf{GapMAJ}\circ f^n$的信息需求关系,此结果渐近最优,还能作为放大工具,用于推导通信和流计算的下界。
摘要:
我们在两人随机通信模型中证明了一个信息理论最优的间隙多数引理。对于基函数$f:\mathcal{X}\to\{\pm1\}$,其$n$重间隙多数合成记为$\mathsf{GapMAJ}\circ f^n$,它接收$n$个输入$(X_1,\ldots,X_n)$并区分$f^{+n}(X_1,\ldots,X_n):=f(X_1)+\ldots + f(X_n)$是至少$0.01\sqrt{n}$还是至多$-0.01\sqrt{n}$。我们表明,如果以$0.501$的成功概率计算$f$需要$I$比特信息,那么以$0.99$的成功概率计算$\mathsf{GapMAJ}\circ f^n$需要$n\cdot(I - O(1))$比特信息。该结果在两个方面是渐近最优的:实现了信息成本的正确线性缩放以及错误率之间正确的常数 - 常数权衡。这使得$\mathsf{GapMAJ}$成为两人通信设置中第三个明确的外部小工具。从应用角度看,间隙多数引理可作为通用放大工具,提升判定$f$的难度到近似$f^{+n}$的难度。利用此框架,我们为间隙汉明的通信下界给出新证明,并推导三角计数的紧密流下界,展示了间隙多数引理的通用性。
英文摘要:
We prove an information-theoretically optimal \emph{gap-majority lemma} in the two-player randomized communication model. For a base function $f: \mathcal{X} \to \{\pm 1\}$, its $n$-fold \emph{gap-majority composition}, denoted $\mathsf{GapMAJ} \circ f^n$, takes $n$ inputs $(X_1, \ldots, X_n)$ and distinguishes whether $f^{+n}(X_1,\ldots,X_n) := f(X_1) + \ldots + f(X_n)$ is at least $0.01\sqrt{n}$ or at most $-0.01\sqrt{n}$. We show that if computing $f$ with success probability $0.501$ requires $I$ bits of information, then computing $\mathsf{GapMAJ} \circ f^n$ with success probability $0.99$ requires $n \cdot (I - O(1))$ bits of information. This result is asymptotically optimal in two aspects: it achieves the correct linear scaling of information cost and the correct constant-constant tradeoff between error rates. This makes $\mathsf{GapMAJ}$, to our knowledge, only the third explicit outer gadget that admits a strong composition theorem in the two-player communication setting, following the identity and XOR gadgets. From an application side, our gap-majority lemma can be viewed as a generic amplification tool that lifts the hardness of deciding $f$ into the hardness of approximating $f^{+n}$. Using this framework, we give a new proof to the communication lower bound of Gap-Hamming and derive a tight streaming lower bound of triangle counting, demonstrating the versatility of the gap-majority lemma.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。