arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1504.05666cs.ITcs.CCmath.IT
收藏

信息复杂度密度与协议仿真

Information Complexity Density and Simulation of Protocols

Himanshu Tyagi, Shaileshh Venkatakrishnan, Pramod Viswanath, Shun Watanabe

摘要:

观察相关随机变量的两方试图运行交互式通信协议。它们必须交换多少比特才能模拟协议,即在输入和原始协议的转录本的联合分布的固定统计距离内产生具有联合分布的视图?我们提出了一个信息谱的方法来解决这个问题,其中的信息复杂性的协议是由其信息复杂性密度。我们的单发边界与模拟协议的通信复杂性信息复杂性密度的尾部边界有关。作为结果,我们得到了一个强逆和特性的通信复杂性的二阶渐近项的独立和同分布的观察序列。此外,我们还得到了适用于任何观测序列和协议的通信复杂性速率的一般公式。与理论计算机科学的结果和函数计算问题的影响的连接进行了讨论。

英文摘要:

Two parties observing correlated random variables seek to run an interactive communication protocol. How many bits must they exchange to simulate the protocol, namely to produce a view with a joint distribution within a fixed statistical distance of the joint distribution of the input and the transcript of the original protocol? We present an information spectrum approach for this problem whereby the information complexity of the protocol is replaced by its information complexity density. Our single-shot bounds relate the communication complexity of simulating a protocol to tail bounds for information complexity density. As a consequence, we obtain a strong converse and characterize the second-order asymptotic term in communication complexity for indepedent and identically distributed observation sequences. Furthermore, we obtain a general formula for the rate of communication complexity which applies to any sequence of observations and protocols. Connections with results from theoretical computer science and implications for the function computation problem are discussed.

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

↑