Learning and testing junta distributions over hypercubes

Many tasks related to the analysis of high-dimensional datasets can be formalized as problems involving learning or testing properties of distributions over a highdimensional domain. In this work, we initiate the study of the following general question: when many of the dimensions of the distribution correspond to "irrelevant" features in the associated dataset, can we learn the distribution efficiently? We formalize this question with the notion of junta distribution. The distribution D over {0, 1}" is a k-junta distribution if the probability mass function p of D is a k-juntai.e., if there is a set J C [n] of at most k coordinates such that for every x c {0, 1}7, the value of p(x) is completely determined by the value of x on the coordinates in J. We show that it is possible to learn k-junta distributions with a number of samples that depends only logarithmically on the total number n of dimensions. We give two proofs of this result; one using the cover method and one by developing a Fourierbased learning algorithm inspired by the Low-Degree Algorithm of Linial, Mansour, and Nisan (1993). We also consider the problem of testing whether an unknown distribution is a k-junta distribution. We introduce an algorithm for this task with sample complexity O(2'/ 2 k) and show that this bound is nearly optimal for constant values of k. As a byproduct of the analysis of the algorithm, we obtain an optimal bound on the number of samples required to test a weighted collection of distribution for uniformity. Finally, we establish the sample complexity for learning and testing other classes of distributions related to junta-distributions. Notably, we show that the task of testing whether a distribution on {0, 1}' contains a coordinate i E [n] such that xi is drawn independently from the remaining coordinates requires 0(2 ,/ 3 ) samples. This is in contrast to the task of testing whether all of the coordinates are drawn independently from each other, which was recently shown to have sample complexity 6(2'/2) by Acharya, Daskalakis, and Kamath (2015). Thesis Supervisor: Ronitt Rubinfeld Title: Professor of Electrical Engineering and Computer Science