Data visualization is an effective mechanism for identifying trends, insights, and anomalies in data. On large datasets, however, generating visualizations can take a long time, delaying theâ€¦ (More)

We study the problem of estimating the value of sums of the form $$S_p \triangleq \sum \left( {\begin{array}{c}x_i\\ p\end{array}}\right) $$ Spâ‰œâˆ‘xip when one has the ability to sample $$x_i \ge 0$$â€¦ (More)

We investigate the problems of identity and closeness testing over a discrete population from random samples. Our goal is to develop efficient testers while guaranteeing Differential Privacy to theâ€¦ (More)

We consider the problem of learning distributions in the presence of irrelevant features. This problem is formalized by introducing a new notion of k-junta distributions. Informally, a distribution Dâ€¦ (More)

Let G be a directed graph and Î» be a positive integer. By a nowhere-zero Î»-flow, we mean an edge assignment using the set {1, . . . , Î» âˆ’ 1} such that at each vertex the sum of the values of allâ€¦ (More)

We study the question of testing structured properties of discrete distributions. Specifically, given sample access to an arbitrary distribution D over [n] and a property P, the goal is toâ€¦ (More)

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â€¦ (More)

We study the fundamental problems of identity and equivalence testing over a discrete population from random samples. Our goal is to develop efficient testers while guaranteeing differential privacyâ€¦ (More)

We study the problem of estimating the value of sums of the form Sp , âˆ‘(xi p ) when one has the ability to sample xi â‰¥ 0 with probability proportional to its magnitude. When p = 2, this problem isâ€¦ (More)