Replicable Distribution Testing
University of Wisconsin-Madison · University Of Wisconsin Madison · UCSD · Computer Science and Engineering Department, University of California, San Diego · University of California San Diego
PDF 由论文原始站点提供，PaperCompass 不保存论文文件。
摘要
We initiate a systematic investigation of distribution testing in the framework of algorithmic replicability. Specifically, given independent samples from a collection of probability distributions, the goal is to characterize the sample complexity of replicably testing natural properties of the underlying distributions. On the algorithmic front, we develop new replicable algorithms for testing closeness and independence of discrete distributions. On the lower bound front, we develop a new methodology for proving sample complexity lower bounds for replicable testing that may be of broader interest. As an application of our technique, we establish near-optimal sample complexity lower bounds for replicable uniformity testing---answering an open question from prior work---and closeness testing.