English
Related papers

Related papers: Testing Identity of Structured Distributions

200 papers

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

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

There has been significant study on the sample complexity of testing properties of distributions over large domains. For many properties, it is known that the sample complexity can be substantially smaller than the domain size. For example,…

Statistics Theory · Mathematics 2019-07-09 Maryam Aliakbarpour , Ravi Kumar , Ronitt Rubinfeld

Motivated by the question of data quantization and "binning," we revisit the problem of identity testing of discrete probability distributions. Identity testing (a.k.a. one-sample testing), a fundamental and by now well-understood problem…

Data Structures and Algorithms · Computer Science 2020-04-28 Clément L. Canonne , Karl Wimmer

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 investigate the problem of identity testing for multidimensional histogram distributions. A distribution $p: D \rightarrow \mathbb{R}_+$, where $D \subseteq \mathbb{R}^d$, is called a $k$-histogram if there exists a partition of the…

Data Structures and Algorithms · Computer Science 2019-02-20 Ilias Diakonikolas , Daniel M. Kane , John Peebles

Given samples from an unknown multivariate distribution $p$, is it possible to distinguish whether $p$ is the product of its marginals versus $p$ being far from every product distribution? Similarly, is it possible to distinguish whether…

Data Structures and Algorithms · Computer Science 2019-07-12 Constantinos Daskalakis , Nishanth Dikkala , Gautam Kamath

We investigate the problem of testing the equivalence between two discrete histograms. A {\em $k$-histogram} over $[n]$ is a probability distribution that is piecewise constant over some set of $k$ intervals over $[n]$. Histograms have been…

Data Structures and Algorithms · Computer Science 2017-03-07 Ilias Diakonikolas , Daniel M. Kane , Vladimir Nikishkin

We give highly efficient algorithms, and almost matching lower bounds, for a range of basic statistical problems that involve testing and estimating the L_1 distance between two k-modal distributions $p$ and $q$ over the discrete domain…

Data Structures and Algorithms · Computer Science 2011-12-26 Constantinos Daskalakis , Ilias Diakonikolas , Rocco A. Servedio , Gregory Valiant , Paul Valiant

We provide a distribution-free test that can be used to determine whether any two joint distributions $p$ and $q$ are statistically different by inspection of a large enough set of samples. Following recent efforts from Long et al. [1], we…

Machine Learning · Computer Science 2016-07-26 Francesco Solera , Andrea Palazzi

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

We consider the identity testing problem - or goodness-of-fit testing problem - in multivariate binomial families, multivariate Poisson families and multinomial distributions. Given a known distribution $p$ and $n$ iid samples drawn from an…

Statistics Theory · Mathematics 2022-04-26 J. Chhor , A. Carpentier

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

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

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 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 investigate the statistical task of closeness (or equivalence) testing for multidimensional distributions. Specifically, given sample access to two unknown distributions $\mathbf p, \mathbf q$ on $\mathbb R^d$, we want to distinguish…

Data Structures and Algorithms · Computer Science 2023-11-23 Ilias Diakonikolas , Daniel M. Kane , Sihan Liu

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
‹ Prev 1 2 3 10 Next ›