arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1602.02390cs.ITmath.IT
收藏

基于Wyner公共信息的交互函数计算的下界

Lower Bounds for Interactive Function Computation via Wyner Common Information

Shijin Rajakrishnan, Sundara Rajan S, Vinod Prabhakaran

摘要:

在理论计算机科学和信息论领域中,协作各方之间需要多少通信来计算其数据的函数的问题具有根本的重要性。在这项工作中,重点是提出这方面的下限。协议的信息成本是协议向Alice和Bob揭示的关于彼此输入的信息量,函数的信息复杂度是所有有效协议的信息成本的下确界。对于摊销的情况下,它是已知的,计算的最佳速率等于信息的复杂性。然而,精确计算这种信息复杂度并不是一件简单的事情。在这项工作中,我们下界信息的独立输入的Wyner共同信息的某一对随机变量的复杂性。我们证明了Wyner公共信息的最优辅助随机变量的一个结构性质,并利用它在某些情况下精确计算Wyner公共信息。通过这种技术得到的下界是紧的一个非平凡的例子-平等(EQ)的三进制字母表。我们也给出一个例子来表明,下界可能,在一般情况下,不紧。

英文摘要:

The question of how much communication is required between collaborating parties to compute a function of their data is of fundamental importance in the fields of theoretical computer science and information theory. In this work, the focus is on coming up with lower bounds on this. The information cost of a protocol is the amount of information the protocol reveals to Alice and Bob about each others inputs, and the information complexity of a function is the infimum of information costs over all valid protocols. For the amortized case, it is known that the optimal rate for the computation is equal to the information complexity. Exactly computing this information complexity is not straight forward however. In this work we lower bound information complexity for independent inputs in terms of the Wyner common information of a certain pair of random variables. We show a structural property for the optimal auxiliary random variable of Wyner common information and exploit this to exactly compute the Wyner common information in certain cases. The lower bound obtained through this technique is shown to be tight for a non-trivial example - equality (EQ) for the ternary alphabet. We also give an example to show that the lower bound may, in general, not be tight.

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

↑