arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1411.3603cs.CCcs.ITmath.ITmath.PR
收藏

使用不完全共享随机性的通信

Communication with Imperfectly Shared Randomness

Clément L. Canonne, Venkatesan Guruswami, Raghu Meka, Madhu Sudan

AI总结:

本文研究标准交互式通信中不完全共享随机性对通信复杂度的影响,证明 exp(k) 比特的一般上界与匹配下界,并分析压缩和协议蒸馏等问题。

摘要:

当通信各方共享独立于通信任务输入的随机性时,许多基本问题的通信复杂度会大幅降低。然而,自然通信过程(例如人与人之间的通信)虽然往往在通信参与者之间包含大量共享相关性,却很少允许完美共享随机性。通信复杂度能否像受益于共享随机性那样受益于共享相关性?这一问题此前主要由 Bavarian 等人(ICALP 2014)在同时通信场景中研究。在本工作中,我们在标准交互式设置下研究该问题,并给出一些一般性结果。具体而言,我们证明:在完美共享随机性下通信复杂度为 k 比特的每个问题,都存在一个使用不完全共享随机性的协议,其复杂度为 exp(k) 比特。我们还通过构造一个承诺问题证明这是最优的:该问题在完美共享随机性下复杂度为 k 比特,而在随机性被不完全共享时需要 exp(k) 比特。在此过程中,我们还强调了压缩和协议蒸馏等其他一些基本问题,其中共享随机性发挥核心作用,并分析这些问题在不完全共享随机性模型中的复杂度。本工作的技术亮点是用于证明我们一般联系紧密度的下界。该结果基于如下直觉:与使用完美共享随机性的通信相比,使用不完全共享随机性的通信必须对其随机输入不那么敏感。形式化证明调用了关于噪声超立方体的小集合扩张结果以及一个不变性原理,将这一直觉转化为证明,从而为这些基础结果提供了一个新的应用领域。

英文摘要:

The communication complexity of many fundamental problems reduces greatly when the communicating parties share randomness that is independent of the inputs to the communication task. Natural communication processes (say between humans) however often involve large amounts of shared correlations among the communicating players, but rarely allow for perfect sharing of randomness. Can the communication complexity benefit from shared correlations as well as it does from shared randomness? This question was considered mainly in the context of simultaneous communication by Bavarian et al. (ICALP 2014). In this work we study this problem in the standard interactive setting and give some general results. In particular, we show that every problem with communication complexity of $k$ bits with perfectly shared randomness has a protocol using imperfectly shared randomness with complexity $\exp(k)$ bits. We also show that this is best possible by exhibiting a promise problem with complexity $k$ bits with perfectly shared randomness which requires $\exp(k)$ bits when the randomness is imperfectly shared. Along the way we also highlight some other basic problems such as compression, and agreement distillation, where shared randomness plays a central role and analyze the complexity of these problems in the imperfectly shared randomness model. The technical highlight of this work is the lower bound that goes into the result showing the tightness of our general connection. This result builds on the intuition that communication with imperfectly shared randomness needs to be less sensitive to its random inputs than communication with perfectly shared randomness. The formal proof invokes results about the small-set expansion of the noisy hypercube and an invariance principle to convert this intuition to a proof, thus giving a new application domain for these fundamental results.

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

↑