Papers
Topics
Authors
Recent
Search
2000 character limit reached

Nonadaptive Noise-Resilient Group Testing with Order-Optimal Tests and Fast-and-Reliable Decoding

Published 14 Nov 2023 in cs.IT, cs.DS, and math.IT | (2311.08283v2)

Abstract: Group testing (GT) is the Boolean version of spare signal recovery and, due to its simplicity, a marketplace for ideas that can be brought to bear upon related problems, such as heavy hitters, compressed sensing, and multiple access channels. The definition of a "good" GT varies from one buyer to another, but it generally includes (i) usage of nonadaptive tests, (ii) limiting to $O(k \log n)$ tests, (iii) resiliency to test noise, (iv) $O(k \mathrm{poly}(\log n))$ decoding time, and (v) lack of mistakes. In this paper, we propose $Gacha~GT$. Gacha is an elementary and self-contained, versatile and unified scheme that, for the first time, satisfies all criteria for a fairly large region of parameters, namely when $\log k < \log(n){1-1/O(1)}$. Outside this parameter region, Gacha can be specialized to outperform the state-of-the-art partial-recovery GTs, exact-recovery GTs, and worst-case GTs. The new idea Gacha brings to the market is a redesigned Reed--Solomon code for probabilistic list-decoding at diminishing code rates over reasonably-large alphabets. Normally, list-decoding a vanilla Reed--Solomon code is equivalent to the nontrivial task of identifying the subsets of points that fit low-degree polynomials. In this paper, we explicitly tell the decoder which points belong to the same polynomial, thus reducing the complexity and enabling the improvement on GT.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (84)
  1. Group testing algorithms: Bounds and simulations. IEEE Transactions on Information Theory, 60(6):3671–3687, June 2014. doi:10.1109/TIT.2014.2314472.
  2. Pooled Testing and Its Applications in the COVID-19 Pandemic, pages 217–249. Springer International Publishing, Cham, 2022. doi:10.1007/978-3-030-78334-1{_}11.
  3. Group testing: An information theory perspective. Foundations and Trends® in Communications and Information Theory, 15(3-4), 2019. doi:10.1561/0100000099.
  4. Matthew Aldridge. The capacity of bernoulli nonadaptive group testing. IEEE Transactions on Information Theory, 63(11):7142–7148, Nov 2017. doi:10.1109/TIT.2017.2748564.
  5. Matthew Aldridge. On the optimality of some group testing algorithms. In 2017 IEEE International Symposium on Information Theory (ISIT), pages 3085–3089, Aachen, Germany, June 2017. IEEE. URL: http://ieeexplore.ieee.org/document/8007097/, doi:10.1109/ISIT.2017.8007097.
  6. Andreas Allemann. An Efficient Algorithm for Combinatorial Group Testing. In Harout Aydinian, Ferdinando Cicalese, and Christian Deppe, editors, Information Theory, Combinatorics, and Search Theory, volume 7777, pages 569–596. Springer Berlin Heidelberg, Berlin, Heidelberg, 2013. URL: http://link.springer.com/10.1007/978-3-642-36899-8_29, doi:10.1007/978-3-642-36899-8_29.
  7. Coded Compressed Sensing With List Recoverable Codes for the Unsourced Random Access. IEEE Transactions on Communications, 70(12):7886–7898, December 2022. URL: https://ieeexplore.ieee.org/document/9928269/, doi:10.1109/TCOMM.2022.3216901.
  8. Boolean compressed sensing and noisy group testing. IEEE Transactions on Information Theory, 58(3):1880–1901, March 2012. doi:10.1109/TIT.2011.2178156.
  9. Sublinear-time non-adaptive group testing with o(k log n) tests via bit-mixing coding. IEEE Transactions on Information Theory, 67(3):1559–1570, March 2021. doi:10.1109/TIT.2020.3046113.
  10. Efficiently Decodable Non-Adaptive Threshold Group Testing. IEEE Transactions on Information Theory, 65(9):5519–5528, September 2019. URL: https://ieeexplore.ieee.org/abstract/document/8676252, doi:10.1109/TIT.2019.2907990.
  11. Random multiple-access communication and group testing. IEEE Transactions on Communications, 32(7):769–779, July 1984. doi:10.1109/TCOM.1984.1096146.
  12. Optimal non-adaptive probabilistic group testing in general sparsity regimes. Information and Inference: A Journal of the IMA, 11(3):1037–1053, 02 2022. arXiv:https://academic.oup.com/imaiai/article-pdf/11/3/1037/45744190/iaab020.pdf, doi:10.1093/imaiai/iaab020.
  13. A. Barg and G. Zemor. Error exponents of expander codes. IEEE Transactions on Information Theory, 48(6):1725–1729, June 2002. doi:10.1109/TIT.2002.1003853.
  14. Finding frequent items in data streams. Theoretical Computer Science, 312(1):3–15, January 2004. URL: https://linkinghub.elsevier.com/retrieve/pii/S0304397503004006, doi:10.1016/S0304-3975(03)00400-6.
  15. Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms. In 2011 49th Annual Allerton Conference on Communication, Control, and Computing (Allerton), pages 1832–1839, Monticello, IL, September 2011. IEEE. URL: http://ieeexplore.ieee.org/document/6120391/, doi:10.1109/Allerton.2011.6120391.
  16. Pattern matching with don’t cares and few errors. Journal of Computer and System Sciences, 76(2):115–124, 2010. URL: https://www.sciencedirect.com/science/article/pii/S0022000009000567, doi:10.1016/j.jcss.2009.06.002.
  17. Tracing traitors. IEEE Transactions on Information Theory, 46(3):893–910, May 2000. doi:10.1109/18.841169.
  18. Semiquantitative Group Testing in at Most Two Rounds. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 1973–1978, July 2021. URL: https://ieeexplore.ieee.org/abstract/document/9518270, doi:10.1109/ISIT45174.2021.9518270.
  19. Mahdi Cheraghchi. Noise-resilient group testing: Limitations and constructions. Discrete Applied Mathematics, 161(1):81–95, 2013. URL: https://www.sciencedirect.com/science/article/pii/S0166218X12003009, doi:10.1016/j.dam.2012.07.022.
  20. Efficient algorithms for noisy group testing. IEEE Transactions on Information Theory, 63(4):2113–2136, April 2017. doi:10.1109/TIT.2017.2659619.
  21. Non-adaptive group testing: Explicit bounds and novel algorithms. IEEE Transactions on Information Theory, 60(5):3019–3035, May 2014. doi:10.1109/TIT.2014.2310477.
  22. Generalized group testing. IEEE Transactions on Information Theory, 69(3):1413–1451, March 2023. doi:10.1109/TIT.2022.3218174.
  23. Graham Cormode and S. Muthukrishnan. An improved data stream summary: The count-min sketch and its applications. Journal of Algorithms, 55(1):58–75, April 2005. URL: https://linkinghub.elsevier.com/retrieve/pii/S0196677403001913, doi:10.1016/j.jalgor.2003.12.001.
  24. Graham Cormode and S. Muthukrishnan. What’s hot and what’s not: Tracking most frequent items dynamically. ACM Trans. Database Syst., 30(1):249–278, mar 2005. doi:10.1145/1061318.1061325.
  25. Combinatorial group testing and sparse recovery schemes with near-optimal decoding time. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS), pages 1203–1213, Nov 2020. doi:10.1109/FOCS46700.2020.00115.
  26. Information-theoretic and algorithmic thresholds for group testing. IEEE Transactions on Information Theory, 66(12):7911–7928, Dec 2020. doi:10.1109/TIT.2020.3023377.
  27. Optimal group testing. Combinatorics, Probability and Computing, 30(6):811–848, 2021. doi:10.1017/S096354832100002X.
  28. Simple codes and sparse recovery with fast decoding. SIAM Journal on Discrete Mathematics, 37(2):612–631, 2023. arXiv:https://doi.org/10.1137/21M1465354, doi:10.1137/21M1465354.
  29. Combinatorial Group Testing and Its Applications. WORLD SCIENTIFIC, 2nd edition, 1999. URL: https://www.worldscientific.com/doi/abs/10.1142/4252, arXiv:https://www.worldscientific.com/doi/pdf/10.1142/4252, doi:10.1142/4252.
  30. Randomized group testing both query-optimal and minimal adaptive. In Mária Bieliková, Gerhard Friedrich, Georg Gottlob, Stefan Katzenbeisser, and György Turán, editors, SOFSEM 2012: Theory and Practice of Computer Science, pages 214–225, Berlin, Heidelberg, 2012. Springer Berlin Heidelberg.
  31. Robert Dorfman. The Detection of Defective Members of Large Populations. The Annals of Mathematical Statistics, 14(4):436 – 440, 1943. doi:10.1214/aoms/1177731363.
  32. Discrete Mathematical Problems with Medical Applications, volume 55 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science. American Mathematical Society, Providence, Rhode Island, December 2000. URL: http://www.ams.org/dimacs/055, doi:10.1090/dimacs/055.
  33. High-Probability List-Recovery, and Applications to Heavy Hitters. In Mikołaj Bojańczyk, Emanuela Merelli, and David P. Woodruff, editors, 49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), volume 229 of Leibniz International Proceedings in Informatics (LIPIcs), pages 55:1–55:17, Dagstuhl, Germany, 2022. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. URL: https://drops.dagstuhl.de/opus/volltexte/2022/16396, doi:10.4230/LIPIcs.ICALP.2022.55.
  34. Compressed genotyping. IEEE Transactions on Information Theory, 56(2):706–723, Feb 2010. doi:10.1109/TIT.2009.2037043.
  35. Probabilistic group testing with a linear number of tests. In 2021 IEEE International Symposium on Information Theory (ISIT), pages 1248–1253, July 2021. doi:10.1109/ISIT45174.2021.9517841.
  36. A compressed sensing approach to pooled rt-pcr testing for covid-19 detection. IEEE Open Journal of Signal Processing, 2:248–264, 2021. doi:10.1109/OJSP.2021.3075913.
  37. Indexing information for data forensics. In John Ioannidis, Angelos Keromytis, and Moti Yung, editors, Applied Cryptography and Network Security, pages 206–221, Berlin, Heidelberg, 2005. Springer Berlin Heidelberg.
  38. Estimation of the prevalence of a rare disease, preserving the anonymity of the subjects by group testing: application to estimating the prevalence of aids antibodies in blood donors. Journal of Statistical Planning and Inference, 22(1):15–27, 1989. URL: https://www.sciencedirect.com/science/article/pii/037837588990061X, doi:10.1016/0378-3758(89)90061-X.
  39. Improved adaptive group testing algorithms with applications to multiple access channels and dead sensor diagnosis. Journal of Combinatorial Optimization, 15(1):95–121, January 2008. URL: http://link.springer.com/10.1007/s10878-007-9087-z, doi:10.1007/s10878-007-9087-z.
  40. On the Parallel Reconstruction from Pooled Data. In 2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS), pages 425–435, Lyon, France, May 2022. IEEE. URL: https://ieeexplore.ieee.org/document/9820733/, doi:10.1109/IPDPS53621.2022.00048.
  41. Group testing and sparse signal recovery. In 2008 42nd Asilomar Conference on Signals, Systems and Computers, pages 1059–1063, Oct 2008. doi:10.1109/ACSSC.2008.5074574.
  42. For-All Sparse Recovery in Near-Optimal Time. In Javier Esparza, Pierre Fraigniaud, Thore Husfeldt, and Elias Koutsoupias, editors, Automata, Languages, and Programming, pages 538–550, Berlin, Heidelberg, 2014. Springer. doi:10.1007/978-3-662-43948-7_45.
  43. ℓℓ\ellroman_ℓ2/ℓℓ\ellroman_ℓ2-Foreach Sparse Recovery with Low Risk. In Fedor V. Fomin, Rūsiņš Freivalds, Marta Kwiatkowska, and David Peleg, editors, Automata, Languages, and Programming, pages 461–472, Berlin, Heidelberg, 2013. Springer. doi:10.1007/978-3-642-39206-1_39.
  44. Optimal rate list decoding over bounded alphabets using algebraic-geometric codes. J. ACM, 69(2), jan 2022. doi:10.1145/3506668.
  45. Group testing for image compression. In Proceedings DCC 2000. Data Compression Conference, pages 3–12, March 2000. doi:10.1109/DCC.2000.838140.
  46. Linear-time list recovery of high-rate expander codes. Information and Computation, 261:202–218, August 2018. URL: https://www.sciencedirect.com/science/article/pii/S0890540118300075, doi:10.1016/j.ic.2018.02.004.
  47. F. K. Hwang. A method for detecting all defective members in a population by group testing. Journal of the American Statistical Association, 67(339):605–608, 1972. URL: https://www.tandfonline.com/doi/abs/10.1080/01621459.1972.10481257, arXiv:https://www.tandfonline.com/doi/pdf/10.1080/01621459.1972.10481257, doi:10.1080/01621459.1972.10481257.
  48. On the optimality of the kautz-singleton construction in probabilistic group testing. IEEE Transactions on Information Theory, 65(9):5592–5603, Sep. 2019. doi:10.1109/TIT.2019.2902397.
  49. Efficiently decodable non-adaptive group testing. In Proceedings of the 2010 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1126–1142, 2010. arXiv:https://epubs.siam.org/doi/pdf/10.1137/1.9781611973075.91, doi:10.1137/1.9781611973075.91.
  50. Strongly explicit and efficiently decodable probabilistic group testing. In 2020 IEEE International Symposium on Information Theory (ISIT), pages 525–530, June 2020. doi:10.1109/ISIT44484.2020.9174462.
  51. Performance of group testing algorithms with near-constant tests per item. IEEE Transactions on Information Theory, 65(2):707–723, Feb 2019. doi:10.1109/TIT.2018.2861772.
  52. Live baiting for service-level dos attackers. In IEEE INFOCOM 2008 - The 27th Conference on Computer Communications, pages 171–175, April 2008. doi:10.1109/INFOCOM.2008.43.
  53. On List Recovery of High-Rate Tensor Codes. IEEE Transactions on Information Theory, 67(1):296–316, January 2021. URL: https://ieeexplore.ieee.org/document/9195853/, doi:10.1109/TIT.2020.3023962.
  54. W. Kautz and R. Singleton. Nonrandom binary superimposed codes. IEEE Transactions on Information Theory, 10(4):363–377, October 1964. doi:10.1109/TIT.1964.1053689.
  55. Saffron: A fast, efficient, and robust framework for group testing based on sparse-graph codes. IEEE Transactions on Signal Processing, 67(17):4649–4664, Sep. 2019. doi:10.1109/TSP.2019.2929938.
  56. 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), pages 1–8, Sep. 2022. doi:10.1109/Allerton49937.2022.9929318.
  57. Neighbor discovery in wireless ad hoc networks based on group testing. In 2008 46th Annual Allerton Conference on Communication, Control, and Computing, pages 791–797, Monticello, IL, USA, September 2008. IEEE. URL: http://ieeexplore.ieee.org/document/4797638/, doi:10.1109/ALLERTON.2008.4797638.
  58. Heavy hitters via cluster-preserving clustering, April 2016. URL: http://arxiv.org/abs/1604.01357, arXiv:1604.01357, doi:10.48550/arXiv.1604.01357.
  59. Heavy hitters via cluster-preserving clustering. Communications of the ACM, 62(8):95–100, July 2019. URL: https://dl.acm.org/doi/10.1145/3339185, doi:10.1145/3339185.
  60. Arya Mazumdar. Nonadaptive group testing with random set of defectives. IEEE Transactions on Information Theory, 62(12):7522–7531, Dec 2016. doi:10.1109/TIT.2016.2613870.
  61. Kazuhiko Minematsu. Property-preserving hash functions and combinatorial group testing. Cryptology ePrint Archive, Paper 2022/478, 2022. https://eprint.iacr.org/2022/478. URL: https://eprint.iacr.org/2022/478.
  62. Robust 1-bit Compressed Sensing with Iterative Hard Thresholding. In Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Proceedings, pages 2941–2979. Society for Industrial and Applied Mathematics, January 2024. URL: https://epubs.siam.org/doi/abs/10.1137/1.9781611977912.105, doi:10.1137/1.9781611977912.105.
  63. A pooled testing strategy for identifying sars-cov-2 at low prevalence. Nature, 589(7841):276–280, 2021. doi:10.1038/s41586-020-2885-5.
  64. Efficiently decodable error-correcting list disjunct matrices and applications. In Luca Aceto, Monika Henzinger, and Jiří Sgall, editors, Automata, Languages and Programming, pages 557–568, Berlin, Heidelberg, 2011. Springer Berlin Heidelberg.
  65. Efficiently Decodable Compressed Sensing by List-Recoverable Codes and Recursion. page 12 pages, 2012. Artwork Size: 12 pages Medium: application/pdf Publisher: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany. URL: http://drops.dagstuhl.de/opus/volltexte/2012/3401/, doi:10.4230/LIPICS.STACS.2012.230.
  66. Explicit nonadaptive combinatorial group testing schemes. IEEE Transactions on Information Theory, 57(12):7982–7989, Dec 2011. doi:10.1109/TIT.2011.2163296.
  67. A Fast Binary Splitting Approach to Non-Adaptive Group Testing. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2020), volume 176, pages 13:1–13:20, 2020. doi:10.4230/LIPIcs.APPROX/RANDOM.2020.13.
  68. Fast splitting algorithms for sparsity-constrained and noisy group testing. Information and Inference: A Journal of the IMA, 12(2):1141–1171, 01 2023. arXiv:https://academic.oup.com/imaiai/article-pdf/12/2/1141/49287871/iaac031.pdf, doi:10.1093/imaiai/iaac031.
  69. Sparse Activity Discovery in Energy Constrained Multi-Cluster IoT Networks Using Group Testing. In ICC 2021 - IEEE International Conference on Communications, pages 1–6, June 2021. URL: https://ieeexplore.ieee.org/abstract/document/9500808, doi:10.1109/ICC42927.2021.9500808.
  70. Phase Transitions in Group Testing, pages 40–53. 2016. URL: https://epubs.siam.org/doi/abs/10.1137/1.9781611974331.ch4, arXiv:https://epubs.siam.org/doi/pdf/10.1137/1.9781611974331.ch4, doi:10.1137/1.9781611974331.ch4.
  71. Limits on support recovery with probabilistic models: An information-theoretic framework. IEEE Transactions on Information Theory, 63(1):593–620, Jan 2017. doi:10.1109/TIT.2016.2606605.
  72. Jonathan Scarlett. An efficient algorithm for capacity-approaching noisy adaptive group testing. In 2019 IEEE International Symposium on Information Theory (ISIT), pages 2679–2683, July 2019. doi:10.1109/ISIT.2019.8849310.
  73. Jonathan Scarlett. Noisy adaptive group testing: Bounds and algorithms. IEEE Transactions on Information Theory, 65(6):3646–3661, June 2019. doi:10.1109/TIT.2018.2883604.
  74. Noisy non-adaptive group testing: A (near-)definite defectives approach. IEEE Transactions on Information Theory, 66(6):3775–3797, June 2020. doi:10.1109/TIT.2020.2970184.
  75. Efficient high-throughput sars-cov-2 testing to detect asymptomatic carriers. Science Advances, 6(37), 2020. URL: https://advances.sciencemag.org/content/6/37/eabc5961, arXiv:https://advances.sciencemag.org/content/6/37/eabc5961.full.pdf, doi:10.1126/sciadv.abc5961.
  76. Long-Term Effects of In-Game Purchases and Event Game Mechanics on Young Mobile Social Game Players in Japan. Simulation & Gaming, 50(1):76–92, February 2019. URL: http://journals.sagepub.com/doi/10.1177/1046878118819677, doi:10.1177/1046878118819677.
  77. On the informativeness and accuracy of pooled testing in estimating prevalence of a rare disease: Application to HIV screening. Biometrika, 82(2):287–297, 06 1995. arXiv:https://academic.oup.com/biomet/article-pdf/82/2/287/5756043/82-2-287.pdf, doi:10.1093/biomet/82.2.287.
  78. Pooled nucleic acid testing to detect antiretroviral treatment failure in hiv-infected patients in mozambique. JAIDS Journal of Acquired Immune Deficiency Syndromes, 70(3), 2015. URL: https://journals.lww.com/jaids/fulltext/2015/11010/pooled_nucleic_acid_testing_to_detect.6.aspx.
  79. Essential Coding Theory. October 2023. URL: https://cse.buffalo.edu/faculty/atri/courses/coding-theory/book/.
  80. Group testing using left-and-right-regular sparse-graph codes, 2017. arXiv:1701.07477.
  81. Quickly-decodable group testing with fewer tests: Price–scarlett’s nonadaptive splitting with explicit scalars. In 2023 IEEE International Symposium on Information Theory (ISIT), pages 1609–1614, June 2023. doi:10.1109/ISIT54713.2023.10206843.
  82. Tropical group testing. IEEE Transactions on Information Theory, 69(9):6098–6120, Sep. 2023. doi:10.1109/TIT.2023.3282847.
  83. J. Wolf. Born again group testing: Multiaccess communications. IEEE Transactions on Information Theory, 31(2):185–191, March 1985. doi:10.1109/TIT.1985.1057026.
  84. Detecting Application Denial-of-Service Attacks: A Group-Testing-Based Approach. IEEE Transactions on Parallel and Distributed Systems, 21(8):1203–1216, August 2010. URL: http://ieeexplore.ieee.org/document/5232807/, doi:10.1109/TPDS.2009.147.
Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free