Adaptive estimation in weighted group testing

We consider a generalization of the problem of estimating the support size of a hidden subset S of a universe U from samples. This framework falls under the group testing [1] and the conditional sampling models [2, 3]. In group testing, for a query set, we are told if it intersects with the set S. We propose a generalization of this problem, where each element has a non-negative weight, and the objective is to estimate the total weight of the universe. In contrast to the regular group testing, we consider stronger access models, where each query outputs an element (with an appropriate probability), and reveals its weight. We show that in this natural generalization of the problem can be solved with only polylogarithmically many queries, and also discuss some lower bounds for the problem.

[1]  Alon Orlitsky,et al.  Faster Algorithms for Testing under Conditional Sampling , 2015, COLT.

[2]  R. Dorfman.  The Detection of Defective Members of Large Populations , 1943 .

[3]  Frank K. Hwang,et al.  A survey on nonadaptive group testing algorithms through the angle of decoding , 2008, J. Comb. Optim..

[4]  Sidharth Jaggi,et al.  Non-Adaptive Group Testing: Explicit Bounds and Novel Algorithms , 2014, IEEE Trans. Inf. Theory.

[5]  Emanuel Knill,et al.  A Comparative Survey of Non-Adaptive Pooling Designs , 1996 .

[6]  P. Massart.  The Tight Constant in the Dvoretzky-Kiefer-Wolfowitz Inequality , 1990 .

[7]  J. Kiefer,et al.  Asymptotic Minimax Character of the Sample Distribution Function and of the Classical Multinomial Estimator , 1956 .

[8]  Graham Kalton,et al.  Introduction to Survey Sampling , 1983 .

[9]  Mayank Bakshi,et al.  GROTESQUE: Noisy Group Testing (Quick and Efficient) , 2013, 2013 51st Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[10]  Carsten Lund,et al.  Priority sampling for estimation of arbitrary subset sums , 2007, JACM.

[11]  Clément L. Canonne,et al.  A Chasm Between Identity and Equivalence Testing with Conditional Queries , 2014, APPROX-RANDOM.

[12]  Rocco A. Servedio,et al.  Testing probability distributions using conditional samples , 2012, Electron. Colloquium Comput. Complex..

[13]  Ding-Zhu Du,et al.  A survey on combinatorial group testing algorithms with applications to DNA Library Screening , 1999, Discrete Mathematical Problems with Medical Applications.

[14]  Dana Ron,et al.  The Power of an Example , 2014, ACM Trans. Comput. Theory.

[15]  Noga Alon,et al.  Estimating arbitrary subset sums with few probes , 2005, PODS '05.

[16]  D. Du,et al.  Combinatorial Group Testing and Its Applications , 1993 .

[17]  George Atia,et al.  Boolean Compressed Sensing and Noisy Group Testing , 2009, IEEE Transactions on Information Theory.

[18]  F. Hwang.  Three Versions of a Group Testing Game , 1984 .

[19]  Eldar Fischer,et al.  On the Power of Conditional Samples in Distribution Testing , 2016, SIAM J. Comput..

[20]  Harald Niederreiter,et al.  Probability and computing: randomized algorithms and probabilistic analysis , 2006, Math. Comput..

[21]  Michael S. Waterman,et al.  Genetic mapping and DNA sequencing , 1996 .

[22]  Tatjana Gerzen.  On a group testing problem: Characterization of graphs with 2-complexity c2 and maximum number of edges , 2011, Discret. Appl. Math..