arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1705.01082cs.ITmath.IT
收藏

共享随机性在不确定通信中的作用

The Power of Shared Randomness in Uncertain Communication

Badih Ghazi, Madhu Sudan

摘要:

在最近的工作(Ghazi等人,SODA 2016),作者与Komargodski和Kothari一起发起了上下文不确定性通信的研究,这是一种旨在了解当通信方不完全共享巨大上下文时如何有效通信的设置。在该设置中,Alice被给予函数$f$和输入字符串$x$,Bob被给予函数$g$和输入字符串$y$。对$(x,y)$来自一个已知的分布$μ$和$f$和$g$在这个分布下保证是接近的。Alice和Bob希望以高概率计算$g(x,y)$。以前的工作表明,在标准模型中具有单向通信复杂度$k$的任何问题在不确定情况下都具有公共硬币通信$O(k(1+I))$位,其中$I$是$x$和$y$之间的互信息。还示出了公共硬币不确定通信上的$Ω(\sqrt{I})$比特的下限。一个悬而未决的重要问题是,公共随机性给不确定的沟通带来了多大的影响。在不确定的情况下,Alice和Bob能在不使用公共随机性的情况下实现有效的通信吗?公共币协议在克服不确定性方面有多强大?受这两个问题的启发:-我们证明了私人硬币不确定通信和公共硬币不确定通信之间的第一个分离。我们展示了一个函数类,其中标准模型中的通信和公共硬币不确定通信是$O(1)$,而私人硬币不确定通信是输入长度$n$的增长函数。- 我们改进了以前关于公共硬币不确定通信的工作的下界。我们展示了一个函数类和一个分布(具有$I \approx n$),其中单向确定通信是$k$位,但单向公共硬币不确定通信至少是$Ω(\sqrt{k} \cdot \sqrt{I})$位。

英文摘要:

In a recent work (Ghazi et al., SODA 2016), the authors with Komargodski and Kothari initiated the study of communication with contextual uncertainty, a setup aiming to understand how efficient communication is possible when the communicating parties imperfectly share a huge context. In this setting, Alice is given a function $f$ and an input string $x$, and Bob is given a function $g$ and an input string $y$. The pair $(x,y)$ comes from a known distribution $μ$ and $f$ and $g$ are guaranteed to be close under this distribution. Alice and Bob wish to compute $g(x,y)$ with high probability. The previous work showed that any problem with one-way communication complexity $k$ in the standard model has public-coin communication $O(k(1+I))$ bits in the uncertain case, where $I$ is the mutual information between $x$ and $y$. A lower bound of $Ω(\sqrt{I})$ bits on the public-coin uncertain communication was also shown. An important question that was left open is the power that public randomness brings to uncertain communication. Can Alice and Bob achieve efficient communication amid uncertainty without using public randomness? How powerful are public-coin protocols in overcoming uncertainty? Motivated by these two questions: - We prove the first separation between private-coin uncertain communication and public-coin uncertain communication. We exhibit a function class for which the communication in the standard model and the public-coin uncertain communication are $O(1)$ while the private-coin uncertain communication is a growing function of the length $n$ of the inputs. - We improve the lower-bound of the previous work on public-coin uncertain communication. We exhibit a function class and a distribution (with $I \approx n$) for which the one-way certain communication is $k$ bits but the one-way public-coin uncertain communication is at least $Ω(\sqrt{k} \cdot \sqrt{I})$ bits.

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

↑