English
Related papers

Related papers: Optimal Randomized Group Testing Algorithm to Dete…

200 papers

The group testing problem consists of determining a small set of defective items from a larger set of items based on tests on groups of items, and is relevant in applications such as medical testing, communication protocols, pattern…

Information Theory · Computer Science 2020-01-27 Steffen Bondorf , Binbin Chen , Jonathan Scarlett , Haifeng Yu , Yuda Zhao

We propose an adaptive sampling approach for multiple testing which aims to maximize statistical power while ensuring anytime false discovery control. We consider $n$ distributions whose means are partitioned by whether they are below or…

Machine Learning · Statistics 2019-07-18 Kevin Jamieson , Lalit Jain

Given observations from a circular random variable contaminated by an additive measurement error, we consider the problem of minimax optimal goodness-of-fit testing in a non-asymptotic framework. We propose direct and indirect testing…

Statistics Theory · Mathematics 2020-07-14 Sandra Schluttenhofer , Jan Johannes

An information theoretic perspective on group testing problems has recently been proposed by Atia and Saligrama, in order to characterise the optimal number of tests. Their results hold in the noiseless case, where only false positives…

Information Theory · Computer Science 2013-03-20 Dino Sejdinovic , Oliver Johnson

Ordinal categorical data are widely collected in psychology, education, and other social sciences, appearing commonly in questionnaires, assessments, and surveys. Latent class models provide a flexible framework for uncovering unobserved…

Machine Learning · Statistics 2026-02-26 Huan Qing

Multi-group agnostic learning is a formal learning criterion that is concerned with the conditional risks of predictors within subgroups of a population. The criterion addresses recent practical concerns such as subgroup fairness and hidden…

Machine Learning · Computer Science 2024-06-18 Christopher Tosh , Daniel Hsu

Group testing with inhibitors (GTI) introduced by Farach at al. is studied in this paper. There are three types of items, $d$ defectives, $r$ inhibitors and $n-d-r$ normal items in a population of $n$ items. The presence of any inhibitor in…

Information Theory · Computer Science 2014-12-16 Abhinav Ganesan , Javad Ebrahimi , Sidharth Jaggi , Venkatesh Saligrama

Inspired by applications in testing for Covid-19, we consider a variant of two-stage group testing called "conservative" (or "trivial") two-stage testing, where every item declared to be defective must be definitively confirmed by being…

Applications · Statistics 2022-03-10 Matthew Aldridge

We study the problem usually referred to as group testing in the context of COVID-19. Given n samples collected from patients, how should we select and test mixtures of samples to maximize information and minimize the number of tests? Group…

Machine Learning · Computer Science 2020-08-07 Louis Abraham , Gary Becigneul , Benjamin Coleman , Bernhard Scholkopf , Anshumali Shrivastava , Alexander Smola

It is imperative for testing to determine if the components within large-scale software systems operate functionally. Interaction testing involves designing a suite of tests, which guarantees to detect a fault if one exists among a small…

Neural and Evolutionary Computing · Computer Science 2020-02-14 Ryan E. Dougherty

In this paper, we aim at solving a class of multiple testing problems under the Bayesian sequential decision framework. Our motivating application comes from binary labeling tasks in crowdsourcing, where the requestor needs to…

Methodology · Statistics 2017-08-29 Xiaoou Li , Yunxiao Chen , Xi Chen , Jingchen Liu , Zhiliang Ying

We study the problem of finding a small subset of items that is \emph{agreeable} to all agents, meaning that all agents value the subset at least as much as its complement. Previous work has shown worst-case bounds, over all instances with…

Computer Science and Game Theory · Computer Science 2019-02-06 Pasin Manurangsi , Warut Suksompong

We consider the problem of ranking $N$ objects starting from a set of noisy pairwise comparisons provided by a crowd of equal workers. We assume that objects are endowed with intrinsic qualities and that the probability with which an object…

Information Retrieval · Computer Science 2020-02-27 Evgenia Christoforou , Alessandro Nordio , Alberto Tarable , Emilio Leonardi

Up to date, only lower and upper bounds for the optimal configuration of a Square Array (A2) Group Testing (GT) algorithm are known. We establish exact analytical formulae and provide a couple of applications of our result. First, we…

Statistics Theory · Mathematics 2023-04-18 Ugnė Čižikovienė , Viktor Skorniakov

Let $G$ be a finite group generated by $k$ elements. The well-known product replacement algorithm provides an effective method for sampling generating sets of $G$. We study a refinement of this algorithm that is designed to output…

Group Theory · Mathematics 2025-12-23 Michał Marcinkowski , Piotr Mizerka

In network tomography, one goal is to identify a small set of failed links in a network, by sending a few packets through the network and seeing which reach their destination. This problem can be seen as a variant of combinatorial group…

Information Theory · Computer Science 2018-09-12 Bruce Spang , Mary Wootters

A key trait of stochastic optimizers is that multiple runs of the same optimizer in attempting to solve the same problem can produce different results. As a result, their performance is evaluated over several repeats, or runs, on the…

Machine Learning · Computer Science 2026-05-18 Moslem Noori , Elisabetta Valiante , Thomas Van Vaerenbergh , Masoud Mohseni , Ignacio Rozada

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

For a voting ensemble that selects an odd-sized subset of the ensemble classifiers at random for each example, applies them to the example, and returns the majority vote, we show that any number of voters may minimize the error rate over an…

Machine Learning · Computer Science 2021-04-27 Eric Bax

Assessing forecasting performance is a time intensive activity, often requiring months or years before we know whether or not the reported forecasts were accurate. Cognitive tests can be quickly administered and are predictive of…

‹ Prev 1 8 9 10 Next ›