English
Related papers

Related papers: Optimal Testing of Discrete Distributions with Hig…

200 papers

We consider the problem of hypothesis testing for discrete distributions. In the standard model, where we have sample access to an underlying distribution $p$, extensive research has established optimal bounds for uniformity testing,…

Machine Learning · Computer Science 2024-12-03 Maryam Aliakbarpour , Piotr Indyk , Ronitt Rubinfeld , Sandeep Silwal

We study the problem of testing identity against a given distribution with a focus on the high confidence regime. More precisely, given samples from an unknown distribution $p$ over $n$ elements, an explicitly given distribution $q$, and…

Data Structures and Algorithms · Computer Science 2019-01-17 Ilias Diakonikolas , Themis Gouleakis , John Peebles , Eric Price

In this work, we give a novel general approach for distribution testing. We describe two techniques: our first technique gives sample-optimal testers, while our second technique gives matching sample lower bounds. As a consequence, we…

Data Structures and Algorithms · Computer Science 2016-05-10 Ilias Diakonikolas , Daniel M. Kane

Given samples from an unknown distribution $p$, is it possible to distinguish whether $p$ belongs to some class of distributions $\mathcal{C}$ versus $p$ being far from every distribution in $\mathcal{C}$? This fundamental question has…

Data Structures and Algorithms · Computer Science 2015-12-09 Jayadev Acharya , Constantinos Daskalakis , Gautam Kamath

We initiate a systematic investigation of distribution testing in the framework of algorithmic replicability. Specifically, given independent samples from a collection of probability distributions, the goal is to characterize the sample…

Machine Learning · Computer Science 2025-07-04 Ilias Diakonikolas , Jingyi Gao , Daniel Kane , Sihan Liu , Christopher Ye

We study the fundamental problems of identity testing (goodness of fit), and closeness testing (two sample test) of distributions over $k$ elements, under differential privacy. While the problems have a long history in statistics, finite…

Machine Learning · Computer Science 2017-11-01 Jayadev Acharya , Ziteng Sun , Huanyu Zhang

Independence testing is a fundamental problem in statistical inference: given samples from a joint distribution $p$ over multiple random variables, the goal is to determine whether $p$ is a product distribution or is $\epsilon$-far from all…

Machine Learning · Statistics 2026-03-06 Maryam Aliakbarpour , Alireza Azizi , Ria Stevens

We study the problem of generalized uniformity testing \cite{BC17} of a discrete probability distribution: Given samples from a probability distribution $p$ over an {\em unknown} discrete domain $\mathbf{\Omega}$, we want to distinguish,…

Data Structures and Algorithms · Computer Science 2017-09-08 Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

We propose a new setting for testing properties of distributions while receiving samples from several distributions, but few samples per distribution. Given samples from $s$ distributions, $p_1, p_2, \ldots, p_s$, we design testers for the…

Data Structures and Algorithms · Computer Science 2019-11-19 Maryam Aliakbarpour , Sandeep Silwal

In this work, we revisit the problem of uniformity testing of discrete probability distributions. A fundamental problem in distribution testing, testing uniformity over a known domain has been addressed over a significant line of works, and…

Data Structures and Algorithms · Computer Science 2017-08-17 Tuğkan Batu , Clément L. Canonne

We study the question of testing structured properties (classes) of discrete distributions. Specifically, given sample access to an arbitrary distribution $D$ over $[n]$ and a property $\mathcal{P}$, the goal is to distinguish between…

Data Structures and Algorithms · Computer Science 2016-01-22 Clément L. Canonne , Ilias Diakonikolas , Themis Gouleakis , Ronitt Rubinfeld

We study the problem of testing \emph{conditional independence} for discrete distributions. Specifically, given samples from a discrete random variable $(X, Y, Z)$ on domain $[\ell_1]\times[\ell_2] \times [n]$, we want to distinguish, with…

Data Structures and Algorithms · Computer Science 2018-07-03 Clément L. Canonne , Ilias Diakonikolas , Daniel M. Kane , Alistair Stewart

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 individuals of the population. We describe…

Machine Learning · Computer Science 2017-07-19 Maryam Aliakbarpour , Ilias Diakonikolas , Ronitt Rubinfeld

We study the question of closeness testing for two discrete distributions. More precisely, given samples from two distributions $p$ and $q$ over an $n$-element set, we wish to distinguish whether $p=q$ versus $p$ is at least $\eps$-far from…

Data Structures and Algorithms · Computer Science 2013-08-20 Siu-On Chan , Ilias Diakonikolas , Gregory Valiant , Paul Valiant

We study distribution testing without direct access to a source of relevant data, but rather to one where only a tiny fraction is relevant. To enable this, we introduce the following verification query model. The goal is to perform a…

Data Structures and Algorithms · Computer Science 2025-09-23 Hadley Black , Christopher Ye

We give a general unified method that can be used for $L_1$ {\em closeness testing} of a wide range of univariate structured distribution families. More specifically, we design a sample optimal and computationally efficient algorithm for…

Data Structures and Algorithms · Computer Science 2015-08-25 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

Private closeness testing asks to decide whether the underlying probability distributions of two sensitive datasets are identical or differ significantly in statistical distance, while guaranteeing (differential) privacy of the data. As in…

Data Structures and Algorithms · Computer Science 2023-09-14 Clément L. Canonne , Yucheng Sun

The objective of goodness-of-fit testing is to assess whether a dataset of observations is likely to have been drawn from a candidate probability distribution. This paper presents a rank-based family of goodness-of-fit tests that is…

Statistics Theory · Mathematics 2019-04-18 Feras A. Saad , Cameron E. Freer , Nathanael L. Ackerman , Vikash K. Mansinghka

The classic problems of testing uniformity of and learning a discrete distribution, given access to independent samples from it, are examined under general $\ell_p$ metrics. The intuitions and results often contrast with the classic…

Data Structures and Algorithms · Computer Science 2015-03-24 Bo Waggoner

We study the general problem of testing whether an unknown distribution belongs to a specified family of distributions. More specifically, given a distribution family $\mathcal{P}$ and sample access to an unknown discrete distribution…

Data Structures and Algorithms · Computer Science 2017-08-09 Clément L. Canonne , Ilias Diakonikolas , Alistair Stewart
‹ Prev 1 2 3 10 Next ›