形状限制性质分布检验的改进和扩展
Improving and extending the testing of distributions for shape-restricted properties
摘要:
分布测试处理关于$\{1,\ldots,n\}$上的未知分布可以推断出什么信息,其中该算法仅允许从分布中获得相对少量的独立样本。在扩展的条件抽样模型中,该算法还允许从原始分布对$\{1,\ldots,n\}$子集的限制中获取样本。在2015年,Canonne、Diakonikolas、Gouleakis和Rubinfeld统一了之前的几个结果,并表明对于满足“可分解性”标准的分布的任何属性,存在一种算法(在基本模型中),可以区分满足该属性的高概率分布和在变化距离上远离它的分布。我们在这里提出了一个更有效但更简单的算法的基本模型,以及非常有效的算法的条件模型,直到现在还没有调查的伞下的可分解的属性。此外,我们提供了一个算法的条件模型,处理一个更大的属性类。我们的核心机制是一种有效地产生满足“细粒度”质量的$\{1,\ldots,n\}$的区间划分的方法。我们表明,有了这样的分区在手,我们可以直接向前移动与测试个别的间隔,而不是首先搜索“正确”的分区$\{1,\ldots,n\}$。
英文摘要:
Distribution testing deals with what information can be deduced about an unknown distribution over $\{1,\ldots,n\}$, where the algorithm is only allowed to obtain a relatively small number of independent samples from the distribution. In the extended conditional sampling model, the algorithm is also allowed to obtain samples from the restriction of the original distribution on subsets of $\{1,\ldots,n\}$. In 2015, Canonne, Diakonikolas, Gouleakis and Rubinfeld unified several previous results, and showed that for any property of distributions satisfying a "decomposability" criterion, there exists an algorithm (in the basic model) that can distinguish with high probability distributions satisfying the property from distributions that are far from it in the variation distance. We present here a more efficient yet simpler algorithm for the basic model, as well as very efficient algorithms for the conditional model, which until now was not investigated under the umbrella of decomposable properties. Additionally, we provide an algorithm for the conditional model that handles a much larger class of properties. Our core mechanism is a way of efficiently producing an interval-partition of $\{1,\ldots,n\}$ that satisfies a "fine-grain" quality. We show that with such a partition at hand we can directly move forward with testing individual intervals, instead of first searching for the "correct" partition of $\{1,\ldots,n\}$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。