activity
20172026
most citedDifferentially Private Identity and Closeness Testing of Discrete Distributions

10 citations · 11 across the 13 of their papers we have counts for

collaborators
Showing cs.DSShow all

5 papers · 1 filter

cs.DS2025

On the Structure of Replicable Hypothesis Testers

Anders Aamand, Maryam Aliakbarpour, Justin Y. Chen +2

A hypothesis testing algorithm is replicable if, when run on two different samples from the same distribution, it produces the same output with high probability. This notion, defin…

cs.DS2025

Nearly-Linear Time Private Hypothesis Selection with the Optimal Approximation Factor

Maryam Aliakbarpour, Zhan Shi, Ria Stevens +1

Estimating the density of a distribution from its samples is a fundamental problem in statistics. Hypothesis selection addresses the setting where, in addition to a sample set, we…

cs.DS20221 cited

Estimation of Entropy in Constant Space with Improved Sample Complexity

Maryam Aliakbarpour, Andrew McGregor, Jelani Nelson +1

Recent work of Acharya et al. (NeurIPS 2019) showed how to estimate the entropy of a distribution over an alphabet of size up to additive error by streaming…

cs.DS2019

Testing Properties of Multiple Distributions with Few Samples

Maryam Aliakbarpour, Sandeep Silwal

We propose a new setting for testing properties of distributions while receiving samples from several distributions, but few samples per distribution. Given samples from distri…

cs.DS2019

Towards Testing Monotonicity of Distributions Over General Posets

Maryam Aliakbarpour, Themis Gouleakis, John Peebles +2

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution over a poset is monotone if, for any…