Skip to content
DraconiticResearch
Search Sources API
197,768 studies31 sourcesUpdated 4 min ago
PreprintarXiv licencearXiv

Sparse Identification for Automatic Large-Scale Screening: A Constraint-Aware Framework with Ultra Fast Decoding Algorithm

Abstract

In the early stages of a pandemic, identification of a small number of infected individuals through large-scale screening is critical for pandemic control, yet remains challenging under limited reagents and testing capacity. Existing group testing methods suffer from either high computational complexity or low identification accuracy. Even worse, no available methods provide theoretically rigorous analysis for sparse identification with hard constraints caused by the sample usage constraint and the dilution effect existing ubiquitously in practical applications. In this article, we propose the Logic Screening method (LoSc), an ultra fast, accurate, and theoretically grounded framework for large-scale screening. LoSc introduces a novel decoding algorithm with a very simple selection strategy, achieving identification of all positives with only O(klogn) pooled tests. The decoding relies only on logical operations, enabling direct hardware implementation and yielding ultra fast computational implementation. Moreover, LoSc explicitly incorporates dilution and sample usage constraints into pooling designs, and establishes theoretical guarantees to guide optimal pooling configurations. Extensive simulations confirm the superior effectiveness, efficiency, and scalability. We believe LoSc offers a fast and reliable solution for automatic large-scale screening.

Related

  1. A domain knowledge-enhanced lightweight transformer for automatic identification of land-use conflicts in territorial spatial planning texts
    Feng Yang, Miaoxing Zhao, Leixiang Ding +2
    PLOS OnePeer-reviewedCC BY 4.0Full textStatisticsPLOS
  2. Enhancing early-stage breakthrough technology identification: A CatBoost model optimized with the SABO algorithm
    Ming Lei, Yin Yu
    PLOS OnePeer-reviewedCC BY 4.0Full textStatisticsOncologyPLOS
  3. A Constraint-Aware Generative Framework for Synthetic Origin-Destination Demand in Logistics Networks
    Leian Chen
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  4. AT-SKM-Net: An Accelerated Trainable Sampling Kaczmarz-Motzkin Framework for Linear Hard-Constraint Feasibility on Dynamic Graphs
    Xiaochen Zhang, Haoyu Zhu, Yao Zhang +1
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
  5. CP-WSP: A Declarative CP-SAT Framework for Configurable Multi-Constraint Workforce Scheduling
    Vipul Patel, Anirudh Deodhar, Dagnachew Birru
    arXivPreprintCC BY-NC-ND 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{li2026sparse,
  title = {{Sparse Identification for Automatic Large-Scale Screening: A Constraint-Aware Framework with Ultra Fast Decoding Algorithm}},
  author = {Jianing Li and Li Chai and Yingcheng Lai},
  howpublished = {arXiv},
  year = {2026},
  month = sep,
  doi = {10.48550/arxiv.2609.21321},
  eprint = {2609.21321},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2609.21321},
}
RIS
TY  - UNPB
TI  - Sparse Identification for Automatic Large-Scale Screening: A Constraint-Aware Framework with Ultra Fast Decoding Algorithm
AU  - Jianing Li
AU  - Li Chai
AU  - Yingcheng Lai
PY  - 2026
DA  - 2026/09/18
PB  - arXiv
DO  - 10.48550/arxiv.2609.21321
UR  - https://arxiv.org/abs/2609.21321
AB  - In the early stages of a pandemic, identification of a small number of infected individuals through large-scale screening is critical for pandemic control, yet remains challenging under limited reagents and testing capacity. Existing group testing methods suffer from either high computational complexity or low identification accuracy. Even worse, no available methods provide theoretically rigorous analysis for sparse identification with hard constraints caused by the sample usage constraint and the dilution effect existing ubiquitously in practical applications. In this article, we propose the Logic Screening method (LoSc), an ultra fast, accurate, and theoretically grounded framework for large-scale screening. LoSc introduces a novel decoding algorithm with a very simple selection strategy, achieving identification of all positives with only O(klogn) pooled tests. The decoding relies only on logical operations, enabling direct hardware implementation and yielding ultra fast computational implementation. Moreover, LoSc explicitly incorporates dilution and sample usage constraints into pooling designs, and establishes theoretical guarantees to guide optimal pooling configurations. Extensive simulations confirm the superior effectiveness, efficiency, and scalability. We believe LoSc offers a fast and reliable solution for automatic large-scale screening.
ER  -