English
Related papers

Related papers: Testing Properties of Multiple Distributions with …

200 papers

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

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

One of the most fundamental problems in distribution testing is the identity testing problem: given samples $x_1,\ldots,x_s$, the goal is to determine whether the samples are drawn from a target distribution $\mathcal{D}$. When…

Quantum Physics · Physics 2026-05-15 Bruno Cavalar , Eli Goldin , Matthew Gray , Taiga Hiroka , Min-Hsiu Hsieh , Tomoyuki Morimae

Testing to see whether a given data set comes from some specified distribution is among the oldest types of problems in Statistics. Many such tests have been developed and their performance studied. The general result has been that while a…

Applications · Statistics 2020-12-07 Wolfgang Rolke

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

Distribution testing deals with what information can be deduced about an unknown distribution over $\{1,\ldots,n\}$, where the algorithm is only allowed to obtain a relatively small number of independent samples from the distribution. In…

Computational Complexity · Computer Science 2016-09-23 Eldar Fischer , Oded Lachish , Yadu Vasudev

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

In this paper, we consider the problem of testing properties of joint distributions under the Conditional Sampling framework. In the standard sampling model, the sample complexity of testing properties of joint distributions is exponential…

Computational Complexity · Computer Science 2022-08-03 Rishiraj Bhattacharyya , Sourav Chakraborty

A Poisson Binomial distribution over $n$ variables is the distribution of the sum of $n$ independent Bernoullis. We provide a sample near-optimal algorithm for testing whether a distribution $P$ supported on $\{0,...,n\}$ to which we have…

Data Structures and Algorithms · Computer Science 2014-10-15 Jayadev Acharya , Constantinos Daskalakis

We study quantum algorithms for verifying properties of the output probability distribution of a classical or quantum circuit, given access to the source code that generates the distribution. We consider the basic task of uniformity…

Quantum Physics · Physics 2024-11-08 Clément L. Canonne , Robin Kothari , Ryan O'Donnell

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

Sampling algorithms play a pivotal role in probabilistic AI. However, verifying if a sampler program indeed samples from the claimed distribution is a notoriously hard problem. Provably correct testers like Barbarik, Teq, Flash, CubeProbe…

Data Structures and Algorithms · Computer Science 2025-12-09 Rishiraj Bhattacharyya , Sourav Chakraborty , Yash Pote , Uddalok Sarkar , Sayantan Sen

We study distributed goodness-of-fit testing for discrete distribution under bandwidth and differential privacy constraints. Information constraint distributed goodness-of-fit testing is a problem that has received considerable attention…

Statistics Theory · Mathematics 2024-11-05 Lasse Vuursteen

Equivalence testing, a fundamental problem in the field of distribution testing, seeks to infer if two unknown distributions on $[n]$ are the same or far apart in the total variation distance. Conditional sampling has emerged as a powerful…

Data Structures and Algorithms · Computer Science 2024-03-08 Diptarka Chakraborty , Sourav Chakraborty , Gunjan Kumar , Kuldeep S. Meel

We study the problem of testing, using only a single sample, between mean field distributions (like Curie-Weiss, Erd\H{o}s-R\'enyi) and structured Gibbs distributions (like Ising model on sparse graphs and Exponential Random Graphs). Our…

Statistics Theory · Mathematics 2018-05-24 Guy Bresler , Dheeraj Nagaraj

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

This paper studies the sample complexity of searching over multiple populations. We consider a large number of populations, each corresponding to either distribution P0 or P1. The goal of the search problem studied here is to find one…

Information Theory · Computer Science 2016-11-17 Matthew L. Malloy , Gongguo Tang , Robert D. Nowak

A new method based on the rejection sampling for finding statistical tests is proposed. This method is conceptually intuitive, easy to implement, and applicable for arbitrary dimension. To illustrate its potential applicability, three…

Methodology · Statistics 2026-03-11 Markku Kuismin