Generalized Framework for Group Testing: Queries, Feedbacks and Adversaries

12/02/2021
by   Marek Klonowski, et al.
0

In the Group Testing problem, the objective is to learn a subset K of some much larger domain N, using the shortest-possible sequence of queries Q. A feedback to a query provides some information about the intersection between the query and subset K. Several specific feedbacks have been studied in the literature, often proving different formulas for the estimate of the query complexity of the problem, defined as the shortest length of queries' sequence solving Group Testing problem with specific feedback. In this paper we study what are the properties of the feedback that influence the query complexity of Group Testing and what is their measurable impact. We propose a generic framework that covers a vast majority of relevant settings considered in the literature, which depends on two fundamental parameters of the feedback: input capacity α and output expressiveness β. They upper bound the logarithm of the size of the feedback function domain and image, respectively. To justify the value of the framework, we prove upper bounds on query complexity of non adaptive, deterministic Group Testing under some "efficient" feedbacks, for minimum, maximum and general expressiveness, and complement them with a lower bound on all feedbacks with given parameters α,β. Our upper bounds also hold if the feedback function could get an input twisted by a malicious adversary, in case the intersection of a query and the hidden set is bigger than the feedback capacity α. We also show that slight change in the feedback function may result in substantial worsening of the query complexity. Additionally, we analyze explicitly constructed randomized counterparts of the deterministic results. Our results provide some insights to what are the most useful bits of information an output-restricted feedback could provide, and open a number of challenging research directions.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/04/2021

Efficient Deterministic Quantitative Group Testing for Precise Information Retrieval

The Quantitative Group Testing (QGT) is about learning a (hidden) subset...
research
06/27/2023

On Detecting Some Defective Items in Group Testing

Group testing is an approach aimed at identifying up to d defective item...
research
11/28/2017

Computing majority with low-fan-in majority queries

In this paper we examine the problem of computing majority function MAJ_...
research
02/14/2012

Noisy Search with Comparative Feedback

We present theoretical results in terms of lower and upper bounds on the...
research
10/01/2020

Understanding the hardness of approximate query processing with joins

We study the hardness of Approximate Query Processing (AQP) of various t...
research
11/05/2019

Bounds for the Number of Tests in Non-Adaptive Randomized Algorithms for Group Testing

We study the group testing problem with non-adaptive randomized algorith...

Please sign up or login with your details

Forgot password? Click here to reset