Isolate and then Identify: Rethinking Adaptive Group Testing (2405.16374v1)
Abstract: Group testing (GT) is the art of identifying binary signals and the marketplace for exchanging new ideas for related fields such as unique-element counting, compressed sensing, traitor tracing, and geno-typing. A GT scheme can be nonadaptive or adaptive; the latter is preferred when latency is ess of an issue. To construct adaptive GT schemes, a popular strategy is to spend the majority of tests in the first few rounds to gain as much information as possible, and uses later rounds to refine details. In this paper, we propose a transparent strategy called "isolate and then identify" (I@I). In the first few rounds, I@I divides the population into teams until every team contains at most one sick person. Then, in the last round, I@I identifies the sick person in each team. Performance-wise, I@I is the first GT scheme that achieves the optimal coefficient $1/$capacity$(Z)$ for the $k \log_2 (n/k)$ term in the number of tests when $Z$ is a generic channel corrupting the test outcomes. I@I follows a modular methodology whereby the isolating part and the identification part can be optimized separately.
- Y. Erlich, A. Gordon, M. Brand, G. J. Hannon, and P. P. Mitra, “Compressed Genotyping,” IEEE Transactions on Information Theory, vol. 56, no. 2, pp. 706–723, Feb. 2010.
- Luo, Jun and Guo, Dongning, “Neighbor discovery in wireless ad hoc networks based on group testing,” in 2008 46th Annual Allerton Conference on Communication, Control, and Computing. Monticello, IL, USA: IEEE, Sep. 2008, pp. 791–797. [Online]. Available: http://ieeexplore.ieee.org/document/4797638/
- A. Lancho, A. Fengler, and Y. Polyanskiy, “Finite-Blocklength Results for the A-channel: Applications to Unsourced Random Access and Group Testing,” in 2022 58th Annual Allerton Conference on Communication, Control, and Computing (Allerton). Monticello, IL, USA: IEEE, Sep. 2022, pp. 1–8.
- M. Cheraghchi and V. Nakos, “Combinatorial Group Testing and Sparse Recovery Schemes with Near-Optimal Decoding Time,” in 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS). Durham, NC, USA: IEEE, Nov. 2020, pp. 1203–1213.
- S. Ahn, W.-N. Chen, and A. Ozgur, “Estimating Sparse Distributions Under Joint Communication and Privacy Constraints,” in 2022 IEEE International Symposium on Information Theory (ISIT). Espoo, Finland: IEEE, Jun. 2022, pp. 3144–3149. [Online]. Available: https://ieeexplore.ieee.org/document/9834610/
- Ying Xuan, Incheol Shin, M. T. Thai, and T. Znati, “Detecting Application Denial-of-Service Attacks: A Group-Testing-Based Approach,” IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 8, pp. 1203–1216, Aug. 2010. [Online]. Available: http://ieeexplore.ieee.org/document/5232807/
- B. Chor, A. Fiat, M. Naor, and B. Pinkas, “Tracing traitors,” IEEE Transactions on Information Theory, vol. 46, no. 3, pp. 893–910, May 2000.
- M. T. Goodrich, M. J. Atallah, and R. Tamassia, “Indexing information for data forensics,” in Applied Cryptography and Network Security, J. Ioannidis, A. Keromytis, and M. Yung, Eds. Berlin, Heidelberg: Springer Berlin Heidelberg, 2005, pp. 206–221.
- K. Minematsu, “Property-Preserving Hash Functions and Combinatorial Group Testing,” 2022.
- E. Hong and R. Ladner, “Group testing for image compression,” in Proceedings DCC 2000. Data Compression Conference, March 2000, pp. 3–12.
- V. Guruswami and H.-P. Wang, “Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding,” Apr. 2024. [Online]. Available: http://arxiv.org/abs/2311.08283
- E. Price and J. Scarlett, “A Fast Binary Splitting Approach to Non-Adaptive Group Testing,” in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), vol. 176, 2020, pp. 13:1–13:20.
- H.-P. Wang, R. Gabrys, and V. Guruswami, “Quickly-Decodable Group Testing with Fewer Tests: Price–Scarlett’s Nonadaptive Splitting with Explicit Scalars,” in 2023 IEEE International Symposium on Information Theory (ISIT). Taipei, Taiwan: IEEE, Jun. 2023, pp. 1609–1614.
- A. Coja-Oghlan, O. Gebhard, M. Hahn-Klimroth, and P. Loick, “Optimal group testing,” Combinatorics, Probability and Computing, vol. 30, no. 6, pp. 811–848, Nov. 2021.
- H. A. Inan and A. Ozgur, “Strongly explicit and efficiently decodable probabilistic group testing,” in 2020 IEEE International Symposium on Information Theory (ISIT), June 2020, pp. 525–530.
- A. Coja-Oghlan, M. Hahn-Klimroth, L. Hintze, D. Kaaser, L. Krieg, M. Rolvien, and O. Scheftelowitsch, “Noisy group testing via spatial coupling,” Feb. 2024. [Online]. Available: http://arxiv.org/abs/2402.02895
- S. Bondorf, B. Chen, J. Scarlett, H. Yu, and Y. Zhao, “Sublinear-time non-adaptive group testing with o(k log n) tests via bit-mixing coding,” IEEE Transactions on Information Theory, vol. 67, no. 3, pp. 1559–1570, March 2021.
- E. Price, J. Scarlett, and N. Tan, “Fast splitting algorithms for sparsity-constrained and noisy group testing,” Information and Inference: A Journal of the IMA, vol. 12, no. 2, pp. 1141–1171, 01 2023. [Online]. Available: https://doi.org/10.1093/imaiai/iaac031
- K. Lee, K. Chandrasekher, R. Pedarsani, and K. Ramchandran, “Saffron: A fast, efficient, and robust framework for group testing based on sparse-graph codes,” IEEE Transactions on Signal Processing, vol. 67, no. 17, pp. 4649–4664, Sep. 2019.
- S. Cai, M. Jahangoshahi, M. Bakshi, and S. Jaggi, “Efficient Algorithms for Noisy Group Testing,” IEEE Transactions on Information Theory, vol. 63, no. 4, pp. 2113–2136, Apr. 2017.
- J. Scarlett, “Noisy adaptive group testing: Bounds and algorithms,” IEEE Transactions on Information Theory, vol. 65, no. 6, pp. 3646–3661, June 2019.
- ——, “An efficient algorithm for capacity-approaching noisy adaptive group testing,” in 2019 IEEE International Symposium on Information Theory (ISIT), July 2019, pp. 2679–2683.
- B. Teo and J. Scarlett, “Noisy adaptive group testing via noisy binary search,” IEEE Transactions on Information Theory, vol. 68, no. 5, pp. 3340–3353, May 2022.
- N. H. Bshouty, “Improved Lower Bound for Estimating the Number of Defective Items,” in Combinatorial Optimization and Applications, W. Wu and J. Guo, Eds. Cham: Springer Nature Switzerland, 2024, pp. 303–315.
- A. Barg and G. Zemor, “Error exponents of expander codes,” IEEE Transactions on Information Theory, vol. 48, no. 6, pp. 1725–1729, June 2002.
- J. Honda and H. Yamamoto, “Polar Coding Without Alphabet Extension for Asymmetric Models,” IEEE Transactions on Information Theory, vol. 59, no. 12, pp. 7829–7838, Dec. 2013. [Online]. Available: http://ieeexplore.ieee.org/document/6601656/
- D. Doron and M. Wootters, “High-Probability List-Recovery, and Applications to Heavy Hitters,” in 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), ser. Leibniz International Proceedings in Informatics (LIPIcs), M. Bojańczyk, E. Merelli, and D. P. Woodruff, Eds., vol. 229. Dagstuhl, Germany: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022, pp. 55:1–55:17. [Online]. Available: https://drops.dagstuhl.de/opus/volltexte/2022/16396