English
Related papers

Related papers: Sequential algorithms for testing identity and clo…

200 papers

Sequential inspection is a technique employed to monitor product quality during the production process. For smaller batch sizes, the Acceptable Quality Limit(AQL) inspection theory is typically applied, whereas for larger batch sizes, the…

Methodology · Statistics 2024-12-17 Dihong Huang

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

Samplers are the backbone of the implementations of any randomised algorithm. Unfortunately, obtaining an efficient algorithm to test the correctness of samplers is very hard to find. Recently, in a series of works, testers like…

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

Mixed-integer optimisation problems can be computationally challenging. Here, we introduce and analyse two efficient algorithms with a specific sequential design that are aimed at dealing with sampled problems within this class. At each…

Optimization and Control · Mathematics 2023-03-07 Mohammadreza Chamanbaz , Roland Bouffanais

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

The problem of joint sequential detection and isolation is considered in the context of multiple, not necessarily independent, data streams. A multiple testing framework is proposed, where each hypothesis corresponds to a different subset…

Statistics Theory · Mathematics 2022-07-04 Anamitra Chaudhuri , Georgios Fellouris

Consider a finite set of sources, each producing i.i.d. observations that follow a unique probability distribution on a finite alphabet. We study the problem of matching a finite set of observed sequences to the set of sources under the…

Information Theory · Computer Science 2014-12-09 Jayakrishnan Unnikrishnan

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

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

We study sequential multiple testing with independent data streams, where the goal is to identify an unknown subset of signals while controlling commonly used error metrics, including generalized familywise rates and false discovery and…

Statistics Theory · Mathematics 2026-03-06 Jingyu Liu , Yanglei Song

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

The identification of anomalies in temporal data is a core component of numerous research areas such as intrusion detection, fault prevention, genomics and fraud detection. This article provides an experimental comparison of the novelty…

Machine Learning · Computer Science 2019-12-02 Rémi Domingues , Pietro Michiardi , Jérémie Barlet , Maurizio Filippone

We revisit outlier hypothesis testing, propose exponentially consistent low complexity fixed-length and sequential tests and show that our tests achieve better tradeoff between detection performance and computational complexity than…

Information Theory · Computer Science 2026-01-09 Jun Diao , Jingjing Wang , Lin Zhou

The sequential multiple testing problem is considered under two generalized error metrics. Under the first one, the probability of at least $k$ mistakes, of any kind, is controlled. Under the second, the probabilities of at least $k_1$…

Statistics Theory · Mathematics 2019-02-18 Yanglei Song , Georgios Fellouris

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 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 consider the problem of learning a discrete distribution in the presence of an $\epsilon$ fraction of malicious data sources. Specifically, we consider the setting where there is some underlying distribution, $p$, and each data source…

Machine Learning · Computer Science 2017-11-23 Mingda Qiao , Gregory Valiant

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 propose sublinear algorithms for probabilistic testing of the discrete and continuous Fr\'echet distance - a standard similarity measure for curves. We assume the algorithm is given access to the input curves via a query oracle: a query…

Computational Geometry · Computer Science 2025-09-05 Peyman Afshani , Maike Buchin , Anne Driemel , Marena Richter , Sampson Wong

This work analyzes the asymptotic performances of fully distributed sequential hypothesis testing procedures as the type-I and type-II error rates approach zero, in the context of a sensor network without a fusion center. In particular, the…

Applications · Statistics 2018-04-17 Shang Li , Xiaodong Wang