English
Related papers

Related papers: Testing Mixtures of Discrete Distributions

200 papers

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 study the question of identity testing for structured distributions. More precisely, given samples from a {\em structured} distribution $q$ over $[n]$ and an explicit distribution $p$ over $[n]$, we wish to distinguish whether $q=p$…

Data Structures and Algorithms · Computer Science 2014-10-10 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

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

Given samples from an unknown distribution $p$ and a description of a distribution $q$, are $p$ and $q$ close or far? This question of "identity testing" has received significant attention in the case of testing whether $p$ and $q$ are…

Data Structures and Algorithms · Computer Science 2017-11-01 Constantinos Daskalakis , Gautam Kamath , John Wright

We consider the problem of closeness testing for two discrete distributions in the practically relevant setting of \emph{unequal} sized samples drawn from each of them. Specifically, given a target error parameter $\varepsilon > 0$, $m_1$…

Machine Learning · Computer Science 2015-04-20 Bhaswar B. Bhattacharya , Gregory Valiant

We revisit the problem of tolerant distribution testing. That is, given samples from an unknown distribution $p$ over $\{1, \dots, n\}$, is it $\varepsilon_1$-close to or $\varepsilon_2$-far from a reference distribution $q$ (in total…

Data Structures and Algorithms · Computer Science 2021-11-10 Clément L. Canonne , Ayush Jain , Gautam Kamath , Jerry Li

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 the problems of identity and closeness testing of $n$-dimensional product distributions. Prior works by Canonne, Diakonikolas, Kane and Stewart (COLT 2017) and Daskalakis and Pan (COLT 2017) have established tight sample complexity…

Data Structures and Algorithms · Computer Science 2021-05-27 Arnab Bhattacharyya , Sutanu Gayen , Saravanan Kandasamy , N. V. Vinodchandran

The framework of distribution testing is currently ubiquitous in the field of property testing. In this model, the input is a probability distribution accessible via independently drawn samples from an oracle. The testing task is to…

Data Structures and Algorithms · Computer Science 2022-09-22 Sourav Chakraborty , Eldar Fischer , Arijit Ghosh , Gopinath Mishra , Sayantan Sen

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 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 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

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

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

In this work, we consider the sample complexity required for testing the monotonicity of distributions over partial orders. A distribution $p$ over a poset is monotone if, for any pair of domain elements $x$ and $y$ such that $x \preceq y$,…

Data Structures and Algorithms · Computer Science 2019-07-09 Maryam Aliakbarpour , Themis Gouleakis , John Peebles , Ronitt Rubinfeld , Anak Yodpinyanee

We are interested in testing properties of distributions with systematically mislabeled samples. Our goal is to make decisions about unknown probability distributions, using a sample that has been collected by a confused collector, such as…

Data Structures and Algorithms · Computer Science 2023-11-27 Renato Ferreira Pinto , Nathaniel Harms

We study the problem of testing discrete distributions with a focus on the high probability regime. Specifically, given samples from one or more discrete distributions, a property $\mathcal{P}$, and parameters $0< \epsilon, \delta <1$, we…

Data Structures and Algorithms · Computer Science 2020-09-15 Ilias Diakonikolas , Themis Gouleakis , Daniel M. Kane , John Peebles , Eric Price

We initiate a study of a new model of property testing that is a hybrid of testing properties of distributions and testing properties of strings. Specifically, the new model refers to testing properties of distributions, but these are…

Data Structures and Algorithms · Computer Science 2024-02-14 Oded Goldreich , Dana Ron

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 examine the extent to which sublinear-sample property testing and estimation apply to settings where samples are independently but not identically distributed. Specifically, we consider the following distributional property testing…

Data Structures and Algorithms · Computer Science 2025-11-05 Shivam Garg , Chirag Pabbaraju , Kirankumar Shiragur , Gregory Valiant
‹ Prev 1 2 3 10 Next ›