Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data
In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal σ∈{0,1}n, we can query multiple entries at once and get the total number of non-zero entries in the query as a result. We assume that queries are time-consuming and therefore...
Saved in:
| Published in: | Journal of parallel and distributed computing Vol. 180; p. 104718 |
|---|---|
| Main Authors: | , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Inc
01.10.2023
|
| Subjects: | |
| ISSN: | 0743-7315, 1096-0848 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Abstract | In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal σ∈{0,1}n, we can query multiple entries at once and get the total number of non-zero entries in the query as a result. We assume that queries are time-consuming and therefore focus on the setting where all queries are executed in parallel. First, we propose and analyze a simple and efficient greedy reconstruction algorithm. Secondly, we derive a sharp information-theoretic threshold for the minimum number of queries required to reconstruct σ with high probability. Finally, we consider two noise models: In the noisy channel model, the result for each entry of the signal flips with a certain probability. In the noisy query model, each query result is subject to random Gaussian noise. We pin down the range of error probabilities and distributions for which our algorithm reconstructs the exact initial states with high probability. Our theoretical findings are complemented by simulations where we compare our simple algorithm with approximate message passing (AMP) that is conjectured to be optimal in a number of related problems.
•We investigate the non-adaptive pooled data problem (sometimes called quantitative group testing).•We prove the information-theoretic phase-transition point in the number of queries required to reconstruct the ground-truth.•We propose an easy and fast greedy-like algorithm and analyze its performance under noisy queries.•Simulations back-up the asymptotic findings for small sample sizes. |
|---|---|
| AbstractList | In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal σ∈{0,1}n, we can query multiple entries at once and get the total number of non-zero entries in the query as a result. We assume that queries are time-consuming and therefore focus on the setting where all queries are executed in parallel. First, we propose and analyze a simple and efficient greedy reconstruction algorithm. Secondly, we derive a sharp information-theoretic threshold for the minimum number of queries required to reconstruct σ with high probability. Finally, we consider two noise models: In the noisy channel model, the result for each entry of the signal flips with a certain probability. In the noisy query model, each query result is subject to random Gaussian noise. We pin down the range of error probabilities and distributions for which our algorithm reconstructs the exact initial states with high probability. Our theoretical findings are complemented by simulations where we compare our simple algorithm with approximate message passing (AMP) that is conjectured to be optimal in a number of related problems.
•We investigate the non-adaptive pooled data problem (sometimes called quantitative group testing).•We prove the information-theoretic phase-transition point in the number of queries required to reconstruct the ground-truth.•We propose an easy and fast greedy-like algorithm and analyze its performance under noisy queries.•Simulations back-up the asymptotic findings for small sample sizes. |
| ArticleNumber | 104718 |
| Author | Hahn-Klimroth, Max Gebhard, Oliver Loick, Philipp Kaaser, Dominik |
| Author_xml | – sequence: 1 givenname: Oliver surname: Gebhard fullname: Gebhard, Oliver organization: TU Dortmund University, Dortmund, Germany – sequence: 2 givenname: Max orcidid: 0000-0002-3995-419X surname: Hahn-Klimroth fullname: Hahn-Klimroth, Max email: maximilian.hahnklimroth@tu-dortmund.de organization: TU Dortmund University, Dortmund, Germany – sequence: 3 givenname: Dominik surname: Kaaser fullname: Kaaser, Dominik organization: TU Hamburg, Hamburg, Germany – sequence: 4 givenname: Philipp surname: Loick fullname: Loick, Philipp organization: Goethe University Frankfurt, Frankfurt, Germany |
| BookMark | eNp9kMtqwzAQRUVJoUnaH-jKP-BUshxLgW5K6CMQ6KZdi7E0amRsy0hKoX9fO-mqi6yGeZyBexZk1vseCblndMUoqx6aVTMYvSpowcdBKZi8InNGN1VOZSlnZE5FyXPB2fqGLGJsKGVsLeScuF1vfeggOd_n6YA-YHI6g95k0H754NKhm_o4oE4x8zYbIEDbYnu6MS6m4OpjQpMF1L4f26OenmU2-C4bvG_HlYEEt-TaQhvx7q8uyefL88f2Ld-_v-62T_tcc0pTrksGokQocL3BDWXAN1BqI5ixVQm1lJzxmgpRgrHGWFsX0lYcrShQamotXxJ5_quDjzGgVdqlU74UwLWKUTUpU42alKlJmTorG9HiHzoE10H4uQw9niEcQ307DCpqh71G40YjSRnvLuG_ckGLIQ |
| CitedBy_id | crossref_primary_10_3150_24_BEJ1784 |
| Cites_doi | 10.1109/TIT.2013.2241175 10.1016/j.aim.2018.05.029 10.1214/aoms/1177731363 10.1109/TIT.2020.3023377 10.1016/j.jcss.2020.02.002 10.1145/76894.76895 10.1177/2211068211435302 10.1016/j.cmi.2020.06.009 10.1137/090772447 10.1007/s004530010033 10.1109/TIT.2021.3138489 10.1109/TIT.2018.2855698 10.1109/TED.2018.2865352 10.1109/TIT.2018.2861772 10.1561/0100000099 10.1287/opre.2018.1780 10.1080/00029890.1963.11992174 10.1186/1471-2105-15-195 10.1007/s10766-017-0502-5 10.1038/nrg930 10.1002/rsa.20417 10.1016/S0019-9958(79)90329-2 10.1109/TIT.2014.2314472 |
| ContentType | Journal Article |
| Copyright | 2023 Elsevier Inc. |
| Copyright_xml | – notice: 2023 Elsevier Inc. |
| DBID | AAYXX CITATION |
| DOI | 10.1016/j.jpdc.2023.104718 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Computer Science |
| EISSN | 1096-0848 |
| ExternalDocumentID | 10_1016_j_jpdc_2023_104718 S0743731523000886 |
| GroupedDBID | --K --M -~X .~1 0R~ 1B1 1~. 1~5 29L 4.4 457 4G. 5GY 5VS 7-5 71M 8P~ 9JN AACTN AAEDT AAEDW AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AAXUO AAYFN ABBOA ABEFU ABFNM ABFSI ABJNI ABMAC ABTAH ABXDB ABYKQ ACDAQ ACGFS ACNNM ACRLP ACZNC ADBBV ADEZE ADFGL ADHUB ADJOM ADMUD ADTZH AEBSH AECPX AEKER AENEX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHJVU AHZHX AIALX AIEXJ AIKHN AITUG AJBFU AJOXV ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOUOD ASPBG AVWKF AXJTR AZFZN BJAXD BKOJK BLXMC CAG COF CS3 DM4 DU5 E.L EBS EFBJH EFLBG EJD EO8 EO9 EP2 EP3 F5P FDB FEDTE FGOYB FIRID FNPLU FYGXN G-2 G-Q G8K GBLVA GBOLZ HLZ HVGLF HZ~ H~9 IHE J1W JJJVA K-O KOM LG5 LG9 LY7 M41 MO0 N9A O-L O9- OAUVE OZT P-8 P-9 P2P PC. Q38 R2- RIG ROL RPZ SBC SDF SDG SDP SES SET SEW SPC SPCBC SST SSV SSZ T5K TN5 TWZ WUQ XJT XOL XPP ZMT ZU3 ZY4 ~G- ~G0 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO ADVLN AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD |
| ID | FETCH-LOGICAL-c300t-c41a74ea2e59e901a39a4cd71df64ab88313b0774adfddffb28f63ef72e8c0ff3 |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001012896700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0743-7315 |
| IngestDate | Sat Nov 29 07:14:08 EST 2025 Tue Nov 18 22:30:08 EST 2025 Fri Feb 23 02:34:40 EST 2024 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Keywords | Quantitative group testing Pooled data Non-adaptive algorithm Noisy pooled data |
| Language | English |
| LinkModel | OpenURL |
| MergedId | FETCHMERGED-LOGICAL-c300t-c41a74ea2e59e901a39a4cd71df64ab88313b0774adfddffb28f63ef72e8c0ff3 |
| ORCID | 0000-0002-3995-419X |
| ParticipantIDs | crossref_citationtrail_10_1016_j_jpdc_2023_104718 crossref_primary_10_1016_j_jpdc_2023_104718 elsevier_sciencedirect_doi_10_1016_j_jpdc_2023_104718 |
| PublicationCentury | 2000 |
| PublicationDate | October 2023 2023-10-00 |
| PublicationDateYYYYMMDD | 2023-10-01 |
| PublicationDate_xml | – month: 10 year: 2023 text: October 2023 |
| PublicationDecade | 2020 |
| PublicationTitle | Journal of parallel and distributed computing |
| PublicationYear | 2023 |
| Publisher | Elsevier Inc |
| Publisher_xml | – name: Elsevier Inc |
| References | Li, Wang (br0430) 2022 Johnson, Aldridge, Scarlett (br0530) 2019; 65 Donoho, Tanner (br0380) 2006 Pati, Rezaiifar, Krishnaprasad (br0400) 1993; vol. 1 Foucart, Rauhut (br0390) 2013 Zhou, Porwal, Zhang, Ngo, Nguyen, Ré, Govindaraju (br0120) 2014; 27 Soderberg, Shapiro (br0280) 1963; 70 Wang, Li, Zhang, Zhang, Zhang (br0050) 2011; 6 Feller (br0610) 1968 Duembgen (br0600) 2010 Liang, Zou (br0010) 2021 Ben-Ami, Klochendler, Seidel (br0040) 2020; 26 Hahn-Klimroth, Müller (br0240) 2022 Alaoui, Ramdas, Krzakala, Zdeborová, Jordan (br0290) 2019; 65 Wang, Zhao, Chuah (br0080) 2015 Karimi, Kazemi, Heidarzadeh, Narayanan, Sprintson (br0200) 2019 De Marco, Jurdziński, Kowalski, Różański, Stachowiak (br0260) 2020; 111 Gao, Sitharam, Roitberg (br0620) 2019; 16 Dubhashi, Panconesi (br0580) 2009 Cao, Li, Sun (br0020) 2014; 15 Erdös, Rényi (br0170) 1963; 8 Grebinski, Kucherov (br0360) 2000; 28 Singh, Joshi, Choudhary (br0540) 2018; 46 Kong, Yuan, Zheng, Chen (br0350) 2012; 17 National AIDS Trust (br0060) 2021 Dinur, Nissim (br0100) 2003 Hahn-Klimroth, Kaaser (br0570) 2022 Scarlett, Cevher (br0300) 2017 Dorfman (br0150) 1943; 14 Constantin, Rao (br0130) 1979; 40 Coja-Oghlan, Krzakala, Perkins, Zdeborová (br0490) 2018; 333 Han, Niu, Ren, Eldar (br0470) 2014 Coja-Oghlan, Gebhard, Hahn-Klimroth, Loick (br0520) 2020; 66 Bshouty (br0270) 2009 Wang, Yin (br0420) 2010; 3 Wang, Huang, Lee, Chen (br0310) 2016 Donoho, Maleki, Montanari (br0440) 2010 Donoho, Maleki, Montanari (br0450) 2010 Sparrer, Fischer (br0410) 2015 Chan, Cai, Bakshi, Jaggi, Saligrama (br0250) 2013 Gebhard, Johnson, Loick, Rolvien (br0320) 2020; 68 Adam, Wortmann (br0090) 1989; 21 Coja-Oghlan, Gebhard, Hahn-Klimroth, Loick (br0220) 2021 Sham, Bader, Craig, O'Donovan, Owen (br0030) 2002; 3 Du, Hwang, Hwang (br0070) 2000 Karimi, Kazemi, Heidarzadeh, Narayanan, Sprintson (br0190) 2019 Djackov (br0180) 1975; vol. 16 Shapiro (br0160) 1960; 67 Le Gallo, Sebastian, Cherubini, Giefers, Eleftheriou (br0460) 2018; 65 Gebhard, Hahn-Klimroth, Kaaser, Loick (br0560) 2022 De Marco, Kowalski (br0370) 2013; 42 Lee, Pedarsani, Ramchandran (br0500) 2016 Aldridge, Johnson, Scarlett (br0210) 2019; 15 Zhou, Jiang, Bruck (br0140) 2013; 59 Chen, Ma, Zhang, Zhou (br0590) Mar. 2019 Zhang, Krzakala, Mézard, Zdeborová (br0340) 2013 Safarpour, Hautala, Silven (br0480) 2018 Aldridge, Johnson, Scarlett (br0510) 2016 Feige, Lellouche (br0230) 2020 Martins, Santos, Sousa (br0110) 2014 Aldridge, Baldassini, Johnson (br0330) 2014; 60 Spencer Asymptopia (br0550) 2014 Donoho (10.1016/j.jpdc.2023.104718_br0450) 2010 Aldridge (10.1016/j.jpdc.2023.104718_br0330) 2014; 60 Aldridge (10.1016/j.jpdc.2023.104718_br0510) 2016 Liang (10.1016/j.jpdc.2023.104718_br0010) 2021 Donoho (10.1016/j.jpdc.2023.104718_br0440) 2010 Le Gallo (10.1016/j.jpdc.2023.104718_br0460) 2018; 65 Erdös (10.1016/j.jpdc.2023.104718_br0170) 1963; 8 Han (10.1016/j.jpdc.2023.104718_br0470) 2014 Dubhashi (10.1016/j.jpdc.2023.104718_br0580) 2009 Chan (10.1016/j.jpdc.2023.104718_br0250) 2013 Feige (10.1016/j.jpdc.2023.104718_br0230) Zhang (10.1016/j.jpdc.2023.104718_br0340) 2013 Gebhard (10.1016/j.jpdc.2023.104718_br0560) 2022 Coja-Oghlan (10.1016/j.jpdc.2023.104718_br0220) 2021 Du (10.1016/j.jpdc.2023.104718_br0070) 2000 Wang (10.1016/j.jpdc.2023.104718_br0050) 2011; 6 Wang (10.1016/j.jpdc.2023.104718_br0420) 2010; 3 Coja-Oghlan (10.1016/j.jpdc.2023.104718_br0520) 2020; 66 Donoho (10.1016/j.jpdc.2023.104718_br0380) 2006 Martins (10.1016/j.jpdc.2023.104718_br0110) 2014 Safarpour (10.1016/j.jpdc.2023.104718_br0480) 2018 Karimi (10.1016/j.jpdc.2023.104718_br0190) 2019 Karimi (10.1016/j.jpdc.2023.104718_br0200) 2019 National AIDS Trust (10.1016/j.jpdc.2023.104718_br0060) Hahn-Klimroth (10.1016/j.jpdc.2023.104718_br0570) 2022 De Marco (10.1016/j.jpdc.2023.104718_br0370) 2013; 42 Li (10.1016/j.jpdc.2023.104718_br0430) Dorfman (10.1016/j.jpdc.2023.104718_br0150) 1943; 14 Singh (10.1016/j.jpdc.2023.104718_br0540) 2018; 46 Soderberg (10.1016/j.jpdc.2023.104718_br0280) 1963; 70 Sparrer (10.1016/j.jpdc.2023.104718_br0410) 2015 Scarlett (10.1016/j.jpdc.2023.104718_br0300) 2017 Spencer Asymptopia (10.1016/j.jpdc.2023.104718_br0550) 2014 Cao (10.1016/j.jpdc.2023.104718_br0020) 2014; 15 Sham (10.1016/j.jpdc.2023.104718_br0030) 2002; 3 Foucart (10.1016/j.jpdc.2023.104718_br0390) 2013 Gao (10.1016/j.jpdc.2023.104718_br0620) 2019; 16 Djackov (10.1016/j.jpdc.2023.104718_br0180) 1975; vol. 16 Bshouty (10.1016/j.jpdc.2023.104718_br0270) 2009 Wang (10.1016/j.jpdc.2023.104718_br0080) 2015 De Marco (10.1016/j.jpdc.2023.104718_br0260) 2020; 111 Grebinski (10.1016/j.jpdc.2023.104718_br0360) 2000; 28 Ben-Ami (10.1016/j.jpdc.2023.104718_br0040) 2020; 26 Coja-Oghlan (10.1016/j.jpdc.2023.104718_br0490) 2018; 333 Zhou (10.1016/j.jpdc.2023.104718_br0140) 2013; 59 Alaoui (10.1016/j.jpdc.2023.104718_br0290) 2019; 65 Aldridge (10.1016/j.jpdc.2023.104718_br0210) 2019; 15 Hahn-Klimroth (10.1016/j.jpdc.2023.104718_br0240) 2022 Kong (10.1016/j.jpdc.2023.104718_br0350) 2012; 17 Constantin (10.1016/j.jpdc.2023.104718_br0130) 1979; 40 Wang (10.1016/j.jpdc.2023.104718_br0310) 2016 Adam (10.1016/j.jpdc.2023.104718_br0090) 1989; 21 Gebhard (10.1016/j.jpdc.2023.104718_br0320) 2020; 68 Chen (10.1016/j.jpdc.2023.104718_br0590) 2019 Dinur (10.1016/j.jpdc.2023.104718_br0100) 2003 Feller (10.1016/j.jpdc.2023.104718_br0610) 1968 Lee (10.1016/j.jpdc.2023.104718_br0500) 2016 Johnson (10.1016/j.jpdc.2023.104718_br0530) 2019; 65 Shapiro (10.1016/j.jpdc.2023.104718_br0160) 1960; 67 Duembgen (10.1016/j.jpdc.2023.104718_br0600) Pati (10.1016/j.jpdc.2023.104718_br0400) 1993; vol. 1 Zhou (10.1016/j.jpdc.2023.104718_br0120) 2014; 27 |
| References_xml | – start-page: 1 year: 2010 end-page: 5 ident: br0440 article-title: Message passing algorithms for compressed sensing: I. Motivation and construction publication-title: 2010 IEEE Information Theory Workshop on Information Theory – volume: vol. 1 start-page: 40 year: 1993 end-page: 44 ident: br0400 article-title: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition publication-title: Proc. 27th ACSSC – year: 2013 ident: br0250 article-title: Stochastic threshold group testing publication-title: 2013 IEEE Information Theory Workshop – start-page: 1 year: 2013 end-page: 39 ident: br0390 article-title: An invitation to compressive sensing publication-title: A Mathematical Introduction to Compressive Sensing – volume: 65 start-page: 572 year: 2019 end-page: 585 ident: br0290 article-title: Decoding from pooled data: phase transitions of message passing publication-title: IEEE Trans. Inf. Theory – volume: 8 start-page: 229 year: 1963 end-page: 243 ident: br0170 article-title: On two problems of information theory publication-title: Magy. Tud. Akad. Mat. Kut. Intéz. Közl. – volume: 27 year: 2014 ident: br0120 article-title: Parallel feature selection inspired by group testing publication-title: Adv. Neural Inf. Process. Syst., NeurIPS – volume: 40 start-page: 20 year: 1979 end-page: 36 ident: br0130 article-title: On the theory of binary asymmetric error correcting codes publication-title: Inf. Control – start-page: 1461 year: 2015 end-page: 1465 ident: br0410 article-title: Soft-feedback omp for the recovery of discrete-valued sparse signals publication-title: Proc. 23rd EUSIPCO – volume: 15 start-page: 195 year: 2014 ident: br0020 article-title: Quantitative group testing-based overlapping pool sequencing to identify rare variant carriers publication-title: BMC Bioinform. – year: 2020 ident: br0230 article-title: Quantitative group testing and the rank of random matrices – start-page: 608 year: 2019 end-page: 614 ident: br0200 article-title: Non-adaptive quantitative group testing using irregular sparse graph codes publication-title: Proc. 2019 IEEE Allerton – volume: 21 start-page: 515 year: 1989 end-page: 556 ident: br0090 article-title: Security-control methods for statistical databases: a comparative study publication-title: ACM Comput. Surv. – start-page: 376 year: 2017 end-page: 384 ident: br0300 article-title: Phase transitions in the pooled data problem publication-title: Proc. 30th NEURIPS – start-page: 1386 year: 2016 end-page: 1390 ident: br0310 article-title: Data extraction via histogram and arithmetic mean queries: fundamental limits and algorithms publication-title: IEEE International Symposium on Information Theory – volume: 42 start-page: 97 year: 2013 end-page: 109 ident: br0370 article-title: Searching for a subset of counterfeit coins: randomization vs determinism and adaptiveness vs non-adaptiveness publication-title: Random Struct. Algorithms – year: 2009 ident: br0580 article-title: Concentration of Measure for the Analysis of Randomized Algorithms – year: 2009 ident: br0270 article-title: Optimal algorithms for the coin weighing problem with a spring scale publication-title: Proc. 22nd Conference on Learning Theory – year: 2000 ident: br0070 article-title: Combinatorial Group Testing and Its Applications, vol. 12 – volume: 68 start-page: 2604 year: 2020 end-page: 2621 ident: br0320 article-title: Improved bounds for noisy group testing with constant tests per item publication-title: IEEE Trans. Inf. Theory – start-page: 958 year: 2021 end-page: 963 ident: br0010 article-title: Neural group testing to accelerate deep learning publication-title: IEEE International Symposium on Information Theory ISIT – start-page: 1 year: 2010 end-page: 5 ident: br0450 article-title: Message passing algorithms for compressed sensing: II. Analysis and validation publication-title: 2010 IEEE Information Theory Workshop on Information Theory – volume: 65 start-page: 707 year: 2019 end-page: 723 ident: br0530 article-title: Performance of group testing algorithms with near-constant tests per item publication-title: IEEE Trans. Inf. Theory – year: 2018 ident: br0480 article-title: An embedded programmable processor for compressive sensing applications publication-title: 2018 IEEE Nordic Circuits and Systems Conference (NORCAS): NORCHIP and International Symposium of System-on-Chip – volume: 66 start-page: 7911 year: 2020 end-page: 7928 ident: br0520 article-title: Information-theoretic and algorithmic thresholds for group testing publication-title: IEEE Trans. Inf. Theory – year: 2010 ident: br0600 article-title: Bounding standard Gaussian tail probabilities – year: 2022 ident: br0570 article-title: Distributed reconstruction of noisy pooled data publication-title: Proc. 42nd IEEE International Conference on Distributed Computing Systems – volume: 15 start-page: 196 year: 2019 end-page: 392 ident: br0210 article-title: Group testing: an information theory perspective publication-title: Found. Trends Commun. Inf. Theory – volume: 65 start-page: 4304 year: 2018 end-page: 4312 ident: br0460 article-title: Compressed sensing with approximate message passing using in-memory computing publication-title: IEEE Trans. Electron Devices – year: 2022 ident: br0430 article-title: Combinatorial quantitative group testing with adversarially perturbed measurements: fundamental limits and algorithm design – start-page: 202 year: 2006 end-page: 206 ident: br0380 article-title: Thresholds for the recovery of sparse solutions via l1 minimization publication-title: Proc. 40th CISS – volume: 14 start-page: 436 year: 1943 end-page: 440 ident: br0150 article-title: The detection of defective members of large populations publication-title: Ann. Math. Stat. – volume: 17 start-page: 169 year: 2012 end-page: 185 ident: br0350 article-title: Automatic liquid handling for life science: a critical review of the current state of the art publication-title: J. Lab. Autom. – year: Mar. 2019 ident: br0590 article-title: Optimal design of process flexibility for general production systems publication-title: Oper. Res. – start-page: 497 year: 2014 end-page: 501 ident: br0470 article-title: Distributed approximate message passing for sparse signal recovery publication-title: 2014 IEEE Global Conference on Signal and Information Processing – volume: vol. 16 start-page: 163 year: 1975 end-page: 170 ident: br0180 article-title: On a Search Model of False Coins publication-title: Topics in Information Theory – volume: 3 start-page: 862 year: 2002 end-page: 871 ident: br0030 article-title: DNA pooling: a tool for large-scale association studies publication-title: Nat. Rev. Genet. – start-page: 202 year: 2003 end-page: 210 ident: br0100 article-title: Revealing information while preserving privacy publication-title: Proceedings of the Twenty-Second ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems – volume: 3 start-page: 462 year: 2010 end-page: 491 ident: br0420 article-title: Sparse signal reconstruction via iterative support detection publication-title: SIAM J. Imaging Sci. – start-page: 1409 year: 2013 end-page: 1414 ident: br0340 article-title: Non-adaptive pooling strategies for detection of rare faulty items publication-title: IEEE International Conference on Communications – volume: 60 start-page: 3671 year: 2014 end-page: 3687 ident: br0330 article-title: Group testing algorithms: bounds and simulations publication-title: IEEE Trans. Inf. Theory – volume: 111 start-page: 42 year: 2020 end-page: 56 ident: br0260 article-title: Subquadratic non-adaptive threshold group testing publication-title: J. Comput. Syst. Sci. – start-page: 1381 year: 2016 end-page: 1385 ident: br0510 article-title: Improved group testing rates with constant column weight designs publication-title: IEEE International Symposium on Information Theory ISIT – volume: 28 start-page: 104 year: 2000 end-page: 124 ident: br0360 article-title: Optimal reconstruction of graphs under the additive model publication-title: Algorithmica – start-page: 2873 year: 2016 end-page: 2877 ident: br0500 article-title: SAFFRON: a fast, efficient, and robust framework for group testing based on sparse-graph codes publication-title: IEEE International Symposium on Information Theory – volume: 70 start-page: 1066 year: 1963 end-page: 1070 ident: br0280 article-title: A combinatory detection problem publication-title: Am. Math. Mon. – volume: 26 start-page: 1248 year: 2020 end-page: 1253 ident: br0040 article-title: Large-scale implementation of pooled RNA extraction and RT-PCR for SARS-CoV-2 detection publication-title: Clin. Microbiol. Infect. – year: 2022 ident: br0560 article-title: On the parallel reconstruction from pooled data publication-title: Proc. 36th IEEE International Parallel & Distributed Processing Symposium – year: 2021 ident: br0060 article-title: UK HIV statistics – start-page: 149 year: 2015 end-page: 153 ident: br0080 article-title: Group testing under sum observations for heavy hitter detection publication-title: Information Theory and Applications Workshop – start-page: 1 year: 2021 end-page: 38 ident: br0220 article-title: Optimal group testing publication-title: Comb. Probab. Comput. – start-page: 55 year: 2014 end-page: 63 ident: br0110 article-title: Testing the maximum by the mean in quantitative group tests publication-title: New Advances in Statistical Modeling and Applications – volume: 46 start-page: 1017 year: 2018 end-page: 1034 ident: br0540 article-title: Survey of GPU based sorting algorithms publication-title: Int. J. Parallel Program. – year: 1968 ident: br0610 article-title: An Introduction to Probability Theory and Its Applications – volume: 333 start-page: 694 year: 2018 end-page: 795 ident: br0490 article-title: Information-theoretic thresholds from the cavity method publication-title: Adv. Math. – volume: 6 year: 2011 ident: br0050 article-title: Evolution of scaling emergence in large-scale spatial epidemic spreading publication-title: PLoS ONE – volume: 16 start-page: 1 year: 2019 end-page: 16 ident: br0620 article-title: Bounds on the Jensen gap, and implications for mean-concentrated distributions publication-title: Aust. J. Math. Anal. Appl. – year: 2014 ident: br0550 – year: 2022 ident: br0240 article-title: Near optimal efficient decoding from pooled data publication-title: Proc. 35th Conference on Learning Theory – volume: 67 start-page: 82 year: 1960 ident: br0160 article-title: Problem e 1399 publication-title: Am. Math. Mon. – start-page: 1 year: 2019 end-page: 5 ident: br0190 article-title: Sparse graph codes for non-adaptive quantitative group testing publication-title: IEEE Information Theory Workshop – volume: 59 start-page: 2988 year: 2013 end-page: 3002 ident: br0140 article-title: Nonuniform codes for correcting asymmetric errors in data storage publication-title: IEEE Trans. Inf. Theory – volume: 59 start-page: 2988 issue: 5 year: 2013 ident: 10.1016/j.jpdc.2023.104718_br0140 article-title: Nonuniform codes for correcting asymmetric errors in data storage publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2013.2241175 – ident: 10.1016/j.jpdc.2023.104718_br0430 – volume: 67 start-page: 82 year: 1960 ident: 10.1016/j.jpdc.2023.104718_br0160 article-title: Problem e 1399 publication-title: Am. Math. Mon. – volume: 27 year: 2014 ident: 10.1016/j.jpdc.2023.104718_br0120 article-title: Parallel feature selection inspired by group testing publication-title: Adv. Neural Inf. Process. Syst., NeurIPS – volume: 333 start-page: 694 year: 2018 ident: 10.1016/j.jpdc.2023.104718_br0490 article-title: Information-theoretic thresholds from the cavity method publication-title: Adv. Math. doi: 10.1016/j.aim.2018.05.029 – volume: 14 start-page: 436 issue: 4 year: 1943 ident: 10.1016/j.jpdc.2023.104718_br0150 article-title: The detection of defective members of large populations publication-title: Ann. Math. Stat. doi: 10.1214/aoms/1177731363 – start-page: 1409 year: 2013 ident: 10.1016/j.jpdc.2023.104718_br0340 article-title: Non-adaptive pooling strategies for detection of rare faulty items – volume: 66 start-page: 7911 issue: 12 year: 2020 ident: 10.1016/j.jpdc.2023.104718_br0520 article-title: Information-theoretic and algorithmic thresholds for group testing publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2020.3023377 – year: 2014 ident: 10.1016/j.jpdc.2023.104718_br0550 – start-page: 2873 year: 2016 ident: 10.1016/j.jpdc.2023.104718_br0500 article-title: SAFFRON: a fast, efficient, and robust framework for group testing based on sparse-graph codes – start-page: 1 year: 2021 ident: 10.1016/j.jpdc.2023.104718_br0220 article-title: Optimal group testing publication-title: Comb. Probab. Comput. – volume: 111 start-page: 42 year: 2020 ident: 10.1016/j.jpdc.2023.104718_br0260 article-title: Subquadratic non-adaptive threshold group testing publication-title: J. Comput. Syst. Sci. doi: 10.1016/j.jcss.2020.02.002 – volume: vol. 16 start-page: 163 year: 1975 ident: 10.1016/j.jpdc.2023.104718_br0180 article-title: On a Search Model of False Coins – volume: 21 start-page: 515 issue: 4 year: 1989 ident: 10.1016/j.jpdc.2023.104718_br0090 article-title: Security-control methods for statistical databases: a comparative study publication-title: ACM Comput. Surv. doi: 10.1145/76894.76895 – year: 2018 ident: 10.1016/j.jpdc.2023.104718_br0480 article-title: An embedded programmable processor for compressive sensing applications – volume: vol. 1 start-page: 40 year: 1993 ident: 10.1016/j.jpdc.2023.104718_br0400 article-title: Orthogonal matching pursuit: recursive function approximation with applications to wavelet decomposition – start-page: 149 year: 2015 ident: 10.1016/j.jpdc.2023.104718_br0080 article-title: Group testing under sum observations for heavy hitter detection – volume: 17 start-page: 169 issue: 3 year: 2012 ident: 10.1016/j.jpdc.2023.104718_br0350 article-title: Automatic liquid handling for life science: a critical review of the current state of the art publication-title: J. Lab. Autom. doi: 10.1177/2211068211435302 – start-page: 1386 year: 2016 ident: 10.1016/j.jpdc.2023.104718_br0310 article-title: Data extraction via histogram and arithmetic mean queries: fundamental limits and algorithms – volume: 26 start-page: 1248 issue: 9 year: 2020 ident: 10.1016/j.jpdc.2023.104718_br0040 article-title: Large-scale implementation of pooled RNA extraction and RT-PCR for SARS-CoV-2 detection publication-title: Clin. Microbiol. Infect. doi: 10.1016/j.cmi.2020.06.009 – volume: 3 start-page: 462 issue: 3 year: 2010 ident: 10.1016/j.jpdc.2023.104718_br0420 article-title: Sparse signal reconstruction via iterative support detection publication-title: SIAM J. Imaging Sci. doi: 10.1137/090772447 – start-page: 608 year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0200 article-title: Non-adaptive quantitative group testing using irregular sparse graph codes – start-page: 1 year: 2010 ident: 10.1016/j.jpdc.2023.104718_br0450 article-title: Message passing algorithms for compressed sensing: II. Analysis and validation – year: 2009 ident: 10.1016/j.jpdc.2023.104718_br0580 – year: 1968 ident: 10.1016/j.jpdc.2023.104718_br0610 – ident: 10.1016/j.jpdc.2023.104718_br0230 – start-page: 958 year: 2021 ident: 10.1016/j.jpdc.2023.104718_br0010 article-title: Neural group testing to accelerate deep learning – volume: 28 start-page: 104 issue: 1 year: 2000 ident: 10.1016/j.jpdc.2023.104718_br0360 article-title: Optimal reconstruction of graphs under the additive model publication-title: Algorithmica doi: 10.1007/s004530010033 – volume: 68 start-page: 2604 issue: 4 year: 2020 ident: 10.1016/j.jpdc.2023.104718_br0320 article-title: Improved bounds for noisy group testing with constant tests per item publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2021.3138489 – year: 2022 ident: 10.1016/j.jpdc.2023.104718_br0240 article-title: Near optimal efficient decoding from pooled data – volume: 65 start-page: 572 issue: 1 year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0290 article-title: Decoding from pooled data: phase transitions of message passing publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2855698 – volume: 16 start-page: 1 issue: 16 year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0620 article-title: Bounds on the Jensen gap, and implications for mean-concentrated distributions publication-title: Aust. J. Math. Anal. Appl. – volume: 6 issue: 7 year: 2011 ident: 10.1016/j.jpdc.2023.104718_br0050 article-title: Evolution of scaling emergence in large-scale spatial epidemic spreading publication-title: PLoS ONE – volume: 65 start-page: 4304 issue: 10 year: 2018 ident: 10.1016/j.jpdc.2023.104718_br0460 article-title: Compressed sensing with approximate message passing using in-memory computing publication-title: IEEE Trans. Electron Devices doi: 10.1109/TED.2018.2865352 – start-page: 55 year: 2014 ident: 10.1016/j.jpdc.2023.104718_br0110 article-title: Testing the maximum by the mean in quantitative group tests – year: 2022 ident: 10.1016/j.jpdc.2023.104718_br0570 article-title: Distributed reconstruction of noisy pooled data – start-page: 1 year: 2013 ident: 10.1016/j.jpdc.2023.104718_br0390 article-title: An invitation to compressive sensing – volume: 65 start-page: 707 issue: 2 year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0530 article-title: Performance of group testing algorithms with near-constant tests per item publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2018.2861772 – start-page: 1381 year: 2016 ident: 10.1016/j.jpdc.2023.104718_br0510 article-title: Improved group testing rates with constant column weight designs – start-page: 1 year: 2010 ident: 10.1016/j.jpdc.2023.104718_br0440 article-title: Message passing algorithms for compressed sensing: I. Motivation and construction – start-page: 1 year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0190 article-title: Sparse graph codes for non-adaptive quantitative group testing – volume: 15 start-page: 196 issue: 3–4 year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0210 article-title: Group testing: an information theory perspective publication-title: Found. Trends Commun. Inf. Theory doi: 10.1561/0100000099 – year: 2019 ident: 10.1016/j.jpdc.2023.104718_br0590 article-title: Optimal design of process flexibility for general production systems publication-title: Oper. Res. doi: 10.1287/opre.2018.1780 – year: 2000 ident: 10.1016/j.jpdc.2023.104718_br0070 – start-page: 202 year: 2006 ident: 10.1016/j.jpdc.2023.104718_br0380 article-title: Thresholds for the recovery of sparse solutions via l1 minimization – year: 2009 ident: 10.1016/j.jpdc.2023.104718_br0270 article-title: Optimal algorithms for the coin weighing problem with a spring scale – volume: 70 start-page: 1066 issue: 10 year: 1963 ident: 10.1016/j.jpdc.2023.104718_br0280 article-title: A combinatory detection problem publication-title: Am. Math. Mon. doi: 10.1080/00029890.1963.11992174 – volume: 15 start-page: 195 year: 2014 ident: 10.1016/j.jpdc.2023.104718_br0020 article-title: Quantitative group testing-based overlapping pool sequencing to identify rare variant carriers publication-title: BMC Bioinform. doi: 10.1186/1471-2105-15-195 – start-page: 497 year: 2014 ident: 10.1016/j.jpdc.2023.104718_br0470 article-title: Distributed approximate message passing for sparse signal recovery – start-page: 202 year: 2003 ident: 10.1016/j.jpdc.2023.104718_br0100 article-title: Revealing information while preserving privacy – volume: 46 start-page: 1017 issue: 6 year: 2018 ident: 10.1016/j.jpdc.2023.104718_br0540 article-title: Survey of GPU based sorting algorithms publication-title: Int. J. Parallel Program. doi: 10.1007/s10766-017-0502-5 – ident: 10.1016/j.jpdc.2023.104718_br0600 – year: 2022 ident: 10.1016/j.jpdc.2023.104718_br0560 article-title: On the parallel reconstruction from pooled data – volume: 3 start-page: 862 year: 2002 ident: 10.1016/j.jpdc.2023.104718_br0030 article-title: DNA pooling: a tool for large-scale association studies publication-title: Nat. Rev. Genet. doi: 10.1038/nrg930 – volume: 42 start-page: 97 year: 2013 ident: 10.1016/j.jpdc.2023.104718_br0370 article-title: Searching for a subset of counterfeit coins: randomization vs determinism and adaptiveness vs non-adaptiveness publication-title: Random Struct. Algorithms doi: 10.1002/rsa.20417 – volume: 40 start-page: 20 issue: 1 year: 1979 ident: 10.1016/j.jpdc.2023.104718_br0130 article-title: On the theory of binary asymmetric error correcting codes publication-title: Inf. Control doi: 10.1016/S0019-9958(79)90329-2 – year: 2013 ident: 10.1016/j.jpdc.2023.104718_br0250 article-title: Stochastic threshold group testing – volume: 60 start-page: 3671 issue: 6 year: 2014 ident: 10.1016/j.jpdc.2023.104718_br0330 article-title: Group testing algorithms: bounds and simulations publication-title: IEEE Trans. Inf. Theory doi: 10.1109/TIT.2014.2314472 – volume: 8 start-page: 229 year: 1963 ident: 10.1016/j.jpdc.2023.104718_br0170 article-title: On two problems of information theory publication-title: Magy. Tud. Akad. Mat. Kut. Intéz. Közl. – ident: 10.1016/j.jpdc.2023.104718_br0060 – start-page: 376 year: 2017 ident: 10.1016/j.jpdc.2023.104718_br0300 article-title: Phase transitions in the pooled data problem – start-page: 1461 year: 2015 ident: 10.1016/j.jpdc.2023.104718_br0410 article-title: Soft-feedback omp for the recovery of discrete-valued sparse signals |
| SSID | ssj0011578 |
| Score | 2.39366 |
| Snippet | In the pooled data problem the goal is to efficiently reconstruct a binary signal from additive measurements. Given a signal σ∈{0,1}n, we can query multiple... |
| SourceID | crossref elsevier |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 104718 |
| SubjectTerms | Noisy pooled data Non-adaptive algorithm Pooled data Quantitative group testing |
| Title | Information-theoretic and algorithmic aspects of parallel and distributed reconstruction from pooled data |
| URI | https://dx.doi.org/10.1016/j.jpdc.2023.104718 |
| Volume | 180 |
| WOSCitedRecordID | wos001012896700001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1096-0848 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0011578 issn: 0743-7315 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV1Lb9NAEF6FlAMX3oiWh_bADW0VP3d9rFARj1KQKCg3a58kkbGjEFX5Mf2xzHjXdoJCBUhcrMjxeq2Z0cx4PN83hLwQUaIK5wrmlFAMIxYTjmfMyFyZTKcqb7vdv57x83MxnRafRqOrDgtzWfG6FptNsfyvqoZzoGyEzv6Fuvubwgn4DUqHI6gdjn-k-AAwwg1YD1P0nKzVt2Y1X8-wHV62EMu2jwPZv6vKes4Ag0S6OAPLIqxFNwPBrEei4Egu-CtA2vbltb-9nW4HSHShEnt-rJpJ31r_scL-kMEdzmr2vpp_XzW-7PNBbvrIICHurnzuj7woPdLorAlD4X2NaLldz4iHzrhQZOuANjt9oC2TKk888vPYel89wf5p4Yk6B2c-2RsYfI1icbxYGiSujBP8uM2D698l3P6Mm-Fe8HYGGZLIb5CDmGeFGJODk7en03f9V6oo85G-e7gAyvL9g7_utD_x2UpmLu6S20Fb9MRbzz0ysvV9cqeb8EGDw39A5nuNiYJm6ZYx0WBMtHG00357zZb26a4xUTQm6o2JojE9JF9en168esPCcA6mQSxrptNI8tTK2GaFhaRSJoVMteGRcXkqlRAJeIEJvFxI44xxTsXC5Yl1PLZCT5xLHpFx3dT2MaEgZAtZu46V0mnMCxkn2qRcJcpliHQ-JFEnuVIH5nocoFKVXYviokRplyjt0kv7kLzs1yw9b8u1V2edQsqQefqMsgT7uWbd0T-ue0JuDab_lIxB-PYZuakv1_Mfq-fBzH4Cbwivfg |
| linkProvider | Elsevier |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Information-theoretic+and+algorithmic+aspects+of+parallel+and+distributed+reconstruction+from+pooled+data&rft.jtitle=Journal+of+parallel+and+distributed+computing&rft.au=Gebhard%2C+Oliver&rft.au=Hahn-Klimroth%2C+Max&rft.au=Kaaser%2C+Dominik&rft.au=Loick%2C+Philipp&rft.date=2023-10-01&rft.pub=Elsevier+Inc&rft.issn=0743-7315&rft.eissn=1096-0848&rft.volume=180&rft_id=info:doi/10.1016%2Fj.jpdc.2023.104718&rft.externalDocID=S0743731523000886 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0743-7315&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0743-7315&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0743-7315&client=summon |