On the Power of Conditional Samples in Distribution Testing
Sourav Chakraborty, Eldar Fischer, Yonatan Goldhirsh, Arie Matsliah

TL;DR
This paper explores the advantages of conditional-sampling oracles in distribution testing, demonstrating that they simplify testing certain properties but not all, compared to traditional sampling methods.
Contribution
It introduces the conditional-sampling oracle, analyzes its impact on distribution testing complexity, and compares its power to ordinary sampling.
Findings
Conditional sampling simplifies testing uniformity and identity.
It reduces complexity for some properties.
For others, complexity remains high.
Abstract
In this paper we define and examine the power of the {\em conditional-sampling} oracle in the context of distribution-property testing. The conditional-sampling oracle for a discrete distribution takes as input a subset of the domain, and outputs a random sample drawn according to , conditioned on (and independently of all prior samples). The conditional-sampling oracle is a natural generalization of the ordinary sampling oracle in which always equals . We show that with the conditional-sampling oracle, testing uniformity, testing identity to a known distribution, and testing any label-invariant property of distributions is easier than with the ordinary sampling oracle. On the other hand, we also show that for some distribution properties the sample-complexity remains near-maximal even with conditional sampling.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
