Verifiable Deep Quantitative Group Testing
Not on the map. Why?
Abstract (arXiv)
We present a neural network-based framework for solving the quantitative group testing (QGT) problem that achieves both high decoding accuracy and structural verifiability. In QGT, the objective is to identify a small subset of defective items among N candidates using only M ll N pooled tests, each reporting the number of defectives in the tested subset. We train a multi-layer perceptron to map noisy measurement vectors to binary defect indicators, achieving accurate and robust recovery even under sparse, bounded perturbations. Beyond accuracy, we show that the trained network implicitly learns the underlying pooling structure that links items to tests, allowing this structure to be recovered directly from the network's Jacobian. This indicates that the model does not merely memorize training patterns but internalizes the true combinatorial relationships governing QGT. Our findings reveal that standard feedforward architectures can learn verifiable inverse mappings in structured combinatorial recovery problems.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 3 of its 17 references that are in the map. First posted on arXiv 8 Dec 2025.
Builds on
3 of 17 references.
References · 3
- 2017Phase Transitions in the Pooled Data Problemcited by 6
- 2023Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testingcited by 3
- 2023Efficient Neural Network based Classification and Outlier Detection for Image Moderation using Compressed Sensing and Group Testingcited by 1
Built on by
Not cited yet.