English
Related papers

Related papers: Noise-Resilient Group Testing: Limitations and Con…

200 papers

This work deals with the problem of distributed data acquisition under non-linear communication constraints. More specifically, we consider a model setup where $M$ distributed nodes take individual measurements of an unknown structured…

Information Theory · Computer Science 2020-01-09 Martin Genzel , Peter Jung

Identification of up to $d$ defective items and up to $h$ inhibitors in a set of $n$ items is the main task of non-adaptive group testing with inhibitors. To efficiently reduce the cost of this Herculean task, a subset of the $n$ items is…

Information Theory · Computer Science 2019-01-10 Thach V. Bui , Minoru Kuribayashi , Tetsuya Kojima , Isao Echizen

This paper introduces the Reed Muller Sieve, a deterministic measurement matrix for compressed sensing. The columns of this matrix are obtained by exponentiating codewords in the quaternary second order Reed Muller code of length $N$. For…

Information Theory · Computer Science 2010-04-20 Robert Calderbank , Stephen Howard , Sina Jafarpour

This paper develops a new method for recovering m-sparse signals that is simultaneously uniform and quick. We present a reconstruction algorithm whose run time, O(m log^2(m) log^2(d)), is sublinear in the length d of the signal. The…

Data Structures and Algorithms · Computer Science 2007-05-23 A. C. Gilbert , M. J. Strauss , J. A. Tropp , R. Vershynin

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. This problem is relevant in areas such as medical testing, data…

Information Theory · Computer Science 2020-11-11 Nelvin Tan , Jonathan Scarlett

In this paper, we consider the mixture of sparse linear regressions model. Let ${\beta}^{(1)},\ldots,{\beta}^{(L)}\in\mathbb{C}^n$ be $ L $ unknown sparse parameter vectors with a total of $ K $ non-zero coefficients. Noisy linear…

Information Theory · Computer Science 2018-08-03 Dong Yin , Ramtin Pedarsani , Yudong Chen , Kannan Ramchandran

We consider the problem of detecting a small subset of defective items from a large set via non-adaptive "random pooling" group tests. We consider both the case when the measurements are noiseless, and the case when the measurements are…

Information Theory · Computer Science 2011-07-25 Chun Lam Chan , Pak Hou Che , Sidharth Jaggi , Venkatesh Saligrama

We consider the problem of robustly testing the norm of a high-dimensional sparse signal vector under two different observation models. In the first model, we are given $n$ i.i.d. samples from the distribution…

Information Theory · Computer Science 2022-11-08 Anand Jerry George , Clément L. Canonne

For the sparse vector model, we consider estimation of the target vector, of its L2-norm and of the noise variance. We construct adaptive estimators and establish the optimal rates of adaptive estimation when adaptation is considered with…

Statistics Theory · Mathematics 2020-03-04 Laëtitia Comminges , Olivier Collier , Mohamed Ndaoud , Alexandre B. Tsybakov

In this paper, an information theoretic analysis on non-adaptive group testing schemes based on sparse pooling graphs is presented. The binary status of the objects to be tested are modeled by i.i.d. Bernoulli random variables with…

Information Theory · Computer Science 2013-04-29 Tadashi Wadayama

Additive asynchronous and cyclostationary impulsive noise limits communication performance in OFDM powerline communication (PLC) systems. Conventional OFDM receivers assume additive white Gaussian noise and hence experience degradation in…

Machine Learning · Statistics 2016-11-18 Jing Lin , Marcel Nassar , Brian L. Evans

We introduce a novel probabilistic group testing framework, termed Poisson group testing, in which the number of defectives follows a right-truncated Poisson distribution. The Poisson model has a number of new applications, including…

Information Theory · Computer Science 2023-07-19 Amin Emad , Olgica Milenkovic

In the classical combinatorial (adaptive) group testing problem, one is given two integers \(d\) and \(n\), where \(0\le d\le n\), and a population of \(n\) items, exactly \(d\) of which are known to be defective. The question is to devise…

Combinatorics · Mathematics 2014-07-24 David Cariolaro , Zhaiming Shen , Yi Zhang

In group testing, simple binary-output tests are designed to identify a small number $t$ of defective items that are present in a large population of $N$ items. Each test takes as input a group of items and produces a binary output…

Information Theory · Computer Science 2017-04-11 Alexander Barg , Arya Mazumdar

Signals sparse in a transformation domain can be recovered from a reduced set of randomly positioned samples by using compressive sensing algorithms. Simple re- construction algorithms are presented in the first part of the paper. The…

Information Theory · Computer Science 2015-12-08 Ljubisa Stankovic , Isidora Stankovic

In a group testing scheme, a set of tests is designed to identify a small number $t$ of defective items that are present among a large number $N$ of items. Each test takes as input a group of items and produces a binary output indicating…

Information Theory · Computer Science 2016-11-17 Arya Mazumdar

We consider several related problems of estimating the 'sparsity' or number of nonzero elements $d$ in a length $n$ vector $\mathbf{x}$ by observing only $\mathbf{b} = M \odot \mathbf{x}$, where $M$ is a predesigned test matrix independent…

Information Theory · Computer Science 2017-07-24 Abhishek Agarwal , Larkin Flodin , Arya Mazumdar

Identification of defective members of large populations has been widely studied in the statistics community under the name of group testing. It involves grouping subsets of items into different pools and detecting defective members based…

Information Theory · Computer Science 2016-11-18 Mahdi Cheraghchi , Ali Hormati , Amin Karbasi , Martin Vetterli

Suppose that we observe $y \in \mathbb{R}^n$ and $X \in \mathbb{R}^{n \times m}$ in the following errors-in-variables model: \begin{eqnarray*} y & = & X_0 \beta^* +\epsilon \\ X & = & X_0 + W, \end{eqnarray*} where $X_0$ is an $n \times m$…

Machine Learning · Statistics 2017-04-04 Mark Rudelson , Shuheng Zhou

We consider in this paper the problem of estimating a parameter matrix from observations which are affected by two types of noise components: (i) a sparse noise sequence which, whenever nonzero can have arbitrarily large amplitude (ii) and…

Systems and Control · Computer Science 2017-11-07 Laurent Bako