Testing Properties of Multiple Distributions with Few Samples
Maryam Aliakbarpour, Sandeep Silwal

TL;DR
This paper introduces sample-efficient algorithms for testing properties of multiple distributions simultaneously, such as uniformity, identity, and closeness, even with limited samples per distribution.
Contribution
It presents the first sample-optimal testers for multiple distribution property testing under a new setting with few samples per distribution.
Findings
Sample-optimal testers for uniformity, identity, and closeness testing.
Effective testing with limited samples per distribution.
Assumption of a natural condition enables optimal sample complexity.
Abstract
We propose a new setting for testing properties of distributions while receiving samples from several distributions, but few samples per distribution. Given samples from distributions, , we design testers for the following problems: (1) Uniformity Testing: Testing whether all the 's are uniform or -far from being uniform in -distance (2) Identity Testing: Testing whether all the 's are equal to an explicitly given distribution or -far from in -distance, and (3) Closeness Testing: Testing whether all the 's are equal to a distribution which we have sample access to, or -far from in -distance. By assuming an additional natural condition about the source distributions, we provide sample optimal testers for all of these problems.
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.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Machine Learning and Algorithms · Cryptography and Data Security
