奇偶迹下的分布测试
Distribution Testing Under the Parity Trace
AI总结:
本文引入奇偶迹下的分布测试抽象,仅揭示样本元素的最低有效位,从而揭示困惑收集者分布测试、测试与学习问题及迹重构属性测试间的联系,并得出新的上下界及紧致界限。
摘要:
分布测试是一项具有许多应用的基础统计任务,但我们关注的许多问题中,样本的系统性误标阻碍了我们应用现有理论。为了将分布测试应用于这些问题,我们引入了奇偶迹下的分布测试,其中算法接收一个有序样本 $S$,该样本仅揭示每个元素的最低有效位。这一抽象揭示了以下三个关注问题之间的联系,从而得出了新的上下界:\n1. 在困惑收集者的分布测试中,样本收集者可能无法区分域中相邻的元素(例如机器学习分类器)。我们证明了域结构为环或路径时困惑收集者分布测试的界限。\n2. 关于基本测试与学习问题的近期工作,通过从分布测试进行归约,确立了无分布样本属性测试的紧致下界,但这种紧致性仅限于对称属性。奇偶迹允许将更广泛的等价性族扩展到非对称属性,同时以不同技术恢复并加强了许多先前结果。\n3. 我们给出了在深入研究过的迹重构模型中进行属性测试的首个结果,其目标是在仅给定 $x$ 的独立随机迹的情况下,测试未知字符串 $x$ 是否满足某属性或远离满足该属性。\n我们的主要技术结果是在奇偶迹下测试 $[n]$ 上分布均匀性的紧致界限 $\widetilde Θ\left((n/ε)^{4/5} + \sqrt n/ε^2\right)$,这也导出了上述问题的结果。
英文摘要:
Distribution testing is a fundamental statistical task with many applications, but we are interested in a variety of problems where systematic mislabelings of the sample prevent us from applying the existing theory. To apply distribution testing to these problems, we introduce distribution testing under the parity trace, where the algorithm receives an ordered sample $S$ that reveals only the least significant bit of each element. This abstraction reveals connections between the following three problems of interest, allowing new upper and lower bounds: 1. In distribution testing with a confused collector, the collector of the sample may be incapable of distinguishing between nearby elements of a domain (e.g. a machine learning classifier). We prove bounds for distribution testing with a confused collector on domains structured as a cycle or a path. 2. Recent work on the fundamental testing vs. learning question established tight lower bounds on distribution-free sample-based property testing by reduction from distribution testing, but the tightness is limited to symmetric properties. The parity trace allows a broader family of equivalences to non-symmetric properties, while recovering and strengthening many of the previous results with a different technique. 3. We give the first results for property testing in the well-studied trace reconstruction model, where the goal is to test whether an unknown string $x$ satisfies some property or is far from satisfying that property, given only independent random traces of $x$. Our main technical result is a tight bound of $\widetilde Θ\left((n/ε)^{4/5} + \sqrt n/ε^2\right)$ for testing uniformity of distributions over $[n]$ under the parity trace, leading also to results for the problems above.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。