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

探索容差分布测试与非容差分布测试之间的差距

Exploring the Gap between Tolerant and Non-tolerant Distribution Testing

Sourav Chakraborty, Eldar Fischer, Arijit Ghosh, Gopinath Mishra, Sayantan Sen

摘要:

分布测试框架目前在属性测试领域中普遍存在。在这个模型中,输入是一个概率分布,可以通过从预言机中独立抽取的样本来访问。测试任务是在$\ell_1$距离上区分满足某个属性的分布和远不满足该属性的分布。容忍测试的任务施加了进一步的限制,即接近满足该属性的分布也被接受。这项工作的重点是连接的样本复杂性的非宽容(“传统”)测试的分布和宽容的测试。当我们的范围限制在标签不变(对称)的分布特性,我们证明了差距是最二次。相反,均匀分布的性质确实已知具有几乎二次间隙。当移动到一般的,不一定标签不变的性质,情况更加复杂,我们展示了一些部分结果。我们表明,如果一个属性要求分布是非集中的,那么它就不能用$o(\sqrt{n})$许多样本进行非容忍测试,其中$n$表示宇宙大小。显然,这意味着最多是二次缺口,因为可以使用$\mathcal{O}(n)$许多样本来学习分布(并因此针对任何属性进行容差测试)。非集中是对属性的一个强烈要求,因为我们也证明了一个接近线性的下限对他们的容忍测试。为了提供其他一般情况下的证据(其中的属性不一定是标签不变的),我们表明,如果输入分布是非常集中的,在这个意义上说,它主要是支持的宇宙的大小$s$的子集,那么它可以学习使用只有$\mathcal{O}(s)$许多样本。学习过程适应输入,并且在不预先知道$s$的情况下工作。

英文摘要:

The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution accessible via independently drawn samples from an oracle. The testing task is to distinguish a distribution that satisfies some property from a distribution that is far from satisfying it in the $\ell_1$ distance. The task of tolerant testing imposes a further restriction, that distributions close to satisfying the property are also accepted. This work focuses on the connection of the sample complexities of non-tolerant ("traditional") testing of distributions and tolerant testing thereof. When limiting our scope to label-invariant (symmetric) properties of distribution, we prove that the gap is at most quadratic. Conversely, the property of being the uniform distribution is indeed known to have an almost-quadratic gap. When moving to general, not necessarily label-invariant properties, the situation is more complicated, and we show some partial results. We show that if a property requires the distributions to be non-concentrated, then it cannot be non-tolerantly tested with $o(\sqrt{n})$ many samples, where $n$ denotes the universe size. Clearly, this implies at most a quadratic gap, because a distribution can be learned (and hence tolerantly tested against any property) using $\mathcal{O}(n)$ many samples. Being non-concentrated is a strong requirement on the property, as we also prove a close to linear lower bound against their tolerant tests. To provide evidence for other general cases (where the properties are not necessarily label-invariant), we show that if an input distribution is very concentrated, in the sense that it is mostly supported on a subset of size $s$ of the universe, then it can be learned using only $\mathcal{O}(s)$ many samples. The learning procedure adapts to the input, and works without knowing $s$ in advance.

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

↑