English
Related papers

Related papers: Telling Two Distributions Apart: a Tight Character…

200 papers

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

We study the following distribution clustering problem: Given a hidden partition of $k$ distributions into two groups, such that the distributions within each group are the same, and the two distributions associated with the two clusters…

Data Structures and Algorithms · Computer Science 2025-12-10 Gunjan Kumar , Yash Pote , Jonathan Scarlett

We study the equivalence testing problem where the goal is to determine if the given two unknown distributions on $[n]$ are equal or $\epsilon$-far in the total variation distance in the conditional sampling model (CFGM, SICOMP16; CRS,…

Data Structures and Algorithms · Computer Science 2023-08-23 Diptarka Chakraborty , Sourav Chakraborty , Gunjan Kumar

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

Given samples from two distributions over an $n$-element set, we wish to test whether these distributions are statistically close. We present an algorithm which uses sublinear in $n$, specifically, $O(n^{2/3}\epsilon^{-8/3}\log n)$,…

Data Structures and Algorithms · Computer Science 2010-11-05 Tugkan Batu , Lance Fortnow , Ronitt Rubinfeld , Warren D. Smith , Patrick White

A pair of probability distributions over $\{0,1\}^n$ is said to be $(k,\delta)$-wise indistinguishable if all of the size $k$ marginals are within statistical distance at most $\delta$. Previous works introduced this concept and study when…

Computational Complexity · Computer Science 2026-05-14 Christopher Williamson

Two-sample inference for the difference of population means typically relies upon a Central Limit Theorem approximation. When data are drawn from a Negative Binomial distribution, previous work of Shilane et al. (2010) showed that a Normal…

Methodology · Statistics 2012-03-06 David Shilane , Derek Bean

Distribution testing is a fundamental statistical task with many applications, but we are interested in a variety of problems where systematic mislabelings of the sample prevent us from applying the existing theory. To apply distribution…

Data Structures and Algorithms · Computer Science 2023-04-05 Renato Ferreira Pinto , Nathaniel Harms

We consider the problem of evaluating black-box multi-class classifiers. In the standard setup, we observe class labels $Y\in \{0,1,\ldots,M-1\}$ generated according to the conditional distribution $ Y|X \sim \text{…

Methodology · Statistics 2026-04-08 Yuchen Chen , Jing Lei

The goodness-of-fit test for discrimination of two tail distribution using higher order statistics is proposed. The consistency of proposed test is proved for two different alternatives. We do not assume belonging the corresponding…

Statistics Theory · Mathematics 2017-02-21 Igor Vladimirovich Rodionov

We point out that double distributions need not vanish at their boundary. Boundary terms do not change the ambiguity inherent in defining double distributions; instead, boundary conditions must be satisfied in order to switch between…

High Energy Physics - Phenomenology · Physics 2009-11-10 B. C. Tiburzi

Given a sequence of samples $x_1, \dots , x_k$ promised to be drawn from one of two distributions $X_0, X_1$, a well-studied problem in statistics is to decide $\textit{which}$ distribution the samples are from. Information theoretically,…

Cryptography and Security · Computer Science 2025-10-29 Cassandra Marcussen , Aaron Putterman , Salil Vadhan

We study the density estimation problem defined as follows: given $k$ distributions $p_1, \ldots, p_k$ over a discrete domain $[n]$, as well as a collection of samples chosen from a ``query'' distribution $q$ over $[n]$, output $p_i$ that…

Data Structures and Algorithms · Computer Science 2024-10-31 Anders Aamand , Alexandr Andoni , Justin Y. Chen , Piotr Indyk , Shyam Narayanan , Sandeep Silwal , Haike Xu

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

We study the problem of distinguishing between two symmetric probability distributions over $n$ bits by observing $k$ bits of a sample, subject to the constraint that all $k-1$-wise marginal distributions of the two distributions are…

Computational Complexity · Computer Science 2021-03-16 Christopher Williamson

The discrepancy between two independent samples \(X_1,\dots,X_n\) and \(Y_1,\dots,Y_n\) drawn from the same distribution on $\mathbb{R}^d$ typically has order \(O(\sqrt{n})\) even in one dimension. We give a simple online algorithm that…

Probability · Mathematics 2026-01-23 Gleb Smirnov , Roman Vershynin

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

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

There has been considerable recent interest in distribution-tests whose run-time and sample requirements are sublinear in the domain-size $k$. We study two of the most important tests under the conditional-sampling model where each query…

Data Structures and Algorithms · Computer Science 2015-04-17 Moein Falahatgar , Ashkan Jafarpour , Alon Orlitsky , Venkatadheeraj Pichapathi , Ananda Theertha Suresh

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