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

相关分布的非交互式模拟是可判定的

Non interactive simulation of correlated distributions is decidable

Anindya De, Elchanan Mossel, Joe Neeman

摘要:

信息论中的一个基本问题如下:设$\mathbf{P} = (\mathbf{X}, \mathbf{Y})$是一个任意分布,其中边缘值$\mathbf{X}$和$\mathbf{Y}$(潜在)相关。假设Alice和Bob是两个参与者,其中Alice获得样本$\{x_i\}_{i \ge 1}$,Bob获得样本$\{y_i\}_{i \ge 1}$,并且对于所有$i$,$(x_i, y_i) \sim \mathbf{P}$。什么样的联合分布$\mathbf{Q}$可以由Alice和Bob在没有任何交互的情况下模拟?当$\mathbf{P}$或$\mathbf{Q}$中至少有一个是$\{0,1\} \times \{0,1\}$上的分布时,G{á}cs-K{<$}rner和Wyner在信息论中的经典著作回答了这个问题,其中每个边缘都是无偏的和相同的。然而,除了这种特殊情况,这个问题的答案是理解在极少数情况下。最近,Ghazi,Kamath和Sudan证明了这个问题对于支持$\{0,1\} \times \{0,1\}$的$\mathbf{Q}$是可判定的。我们将他们的结果推广到任意有限字母表上支持的$\mathbf{Q}$。我们依赖于最近的结果在高斯几何(作者),以及一个新的\emph{smoothing argument}的启发方法的\emph{boosting}从学习理论和潜在的功能参数的复杂性理论和添加剂组合。

英文摘要:

A basic problem in information theory is the following: Let $\mathbf{P} = (\mathbf{X}, \mathbf{Y})$ be an arbitrary distribution where the marginals $\mathbf{X}$ and $\mathbf{Y}$ are (potentially) correlated. Let Alice and Bob be two players where Alice gets samples $\{x_i\}_{i \ge 1}$ and Bob gets samples $\{y_i\}_{i \ge 1}$ and for all $i$, $(x_i, y_i) \sim \mathbf{P}$. What joint distributions $\mathbf{Q}$ can be simulated by Alice and Bob without any interaction? Classical works in information theory by G{á}cs-K{ö}rner and Wyner answer this question when at least one of $\mathbf{P}$ or $\mathbf{Q}$ is the distribution on $\{0,1\} \times \{0,1\}$ where each marginal is unbiased and identical. However, other than this special case, the answer to this question is understood in very few cases. Recently, Ghazi, Kamath and Sudan showed that this problem is decidable for $\mathbf{Q}$ supported on $\{0,1\} \times \{0,1\}$. We extend their result to $\mathbf{Q}$ supported on any finite alphabet. We rely on recent results in Gaussian geometry (by the authors) as well as a new \emph{smoothing argument} inspired by the method of \emph{boosting} from learning theory and potential function arguments from complexity theory and additive combinatorics.

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

↑