arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1702.01454cs.CC
收藏

联合分布的条件样本性质检验

Property Testing of Joint Distributions using Conditional Samples

Rishiraj Bhattacharyya, Sourav Chakraborty

摘要:

本文在条件抽样框架下研究了联合分布的性质检验问题。在标准抽样模型中,联合分布性质检验的样本复杂度在维数上是指数级的,导致实际应用中的算法效率低下。虽然最近的结果以显着较小的样本复杂度实现了产品分布的有效算法,但当边缘不独立时,预计不会有有效的算法。我们在多维背景下开始了条件抽样的研究。我们提出了一个子立方体条件抽样模型,测试人员可以条件(自适应)选择的子立方体的域。由于其简单性,该模型在许多实际应用中是潜在可实现的,特别是当分布是针对某个集合$Σ$的$Σ^n$上的联合分布时。我们提出了算法的各种基本性质的分布在子立方体条件模型,并证明了样本的复杂性是多项式的维度$n$(而不是指数在传统的模型)。我们提出了一个算法测试同一性的一个已知的分布使用$\tilde{\mathcal{O}}(n^2)$ -子立方体条件样本,一个算法测试同一性的两个未知的分布之间使用$\tilde{\mathcal{O}}(n^5)$ -子立方体条件样本和一个算法测试同一性的产品分布使用$tilde{\mathcal{O}}(n^5)$ -子立方体条件样本。我们的技术的中心概念涉及到一个优雅的链式法则,它可以使用概率论的基本技术来证明,但足够强大,以避免维数灾难。

英文摘要:

In this paper, we consider the problem of testing properties of joint distributions under the Conditional Sampling framework. In the standard sampling model, the sample complexity of testing properties of joint distributions is exponential in the dimension, resulting in inefficient algorithms for practical use. While recent results achieve efficient algorithms for product distributions with significantly smaller sample complexity, no efficient algorithm is expected when the marginals are not independent. We initialize the study of conditional sampling in the multidimensional setting. We propose a subcube conditional sampling model where the tester can condition on an (adaptively) chosen subcube of the domain. Due to its simplicity, this model is potentially implementable in many practical applications, particularly when the distribution is a joint distribution over $Σ^n$ for some set $Σ$. We present algorithms for various fundamental properties of distributions in the subcube-conditioning model and prove that the sample complexity is polynomial in the dimension $n$ (and not exponential as in the traditional model). We present an algorithm for testing identity to a known distribution using $\tilde{\mathcal{O}}(n^2)$-subcube-conditional samples, an algorithm for testing identity between two unknown distributions using $\tilde{\mathcal{O}}(n^5)$-subcube-conditional samples and an algorithm for testing identity to a product distribution using $tilde{\mathcal{O}}(n^5)$-subcube-conditional samples. The central concept of our technique involves an elegant chain rule which can be proved using basic techniques of probability theory yet powerful enough to avoid the curse of dimensionality.

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

↑