activity
20202024
most citedApproximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing

5 citations · 12 across the 7 of their papers we have counts for

collaborators

7 papers

cs.IT2024

Quantitative Group Testing and Pooled Data in the Linear Regime with Sublinear Tests

Nelvin Tan, Pablo Pascual Cobo, Ramji Venkataramanan

In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number o…

cs.IT2023★ 5 cited

Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing

Nelvin Tan, Pablo Pascual Cobo, Jonathan Scarlett +1

In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number o…

stat.ML2023★ 1 cited

Mixed Regression via Approximate Message Passing

Nelvin Tan, Ramji Venkataramanan

We study the problem of regression in a generalized linear model (GLM) with multiple signals and latent variables. This model, which we call a matrix GLM, covers many widely studie…

cs.IT2022

Performance Bounds for Group Testing With Doubly-Regular Designs

Nelvin Tan, Way Tan, Jonathan Scarlett

In the group testing problem, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is…

cs.IT2021★ 1 cited

Fast Splitting Algorithms for Sparsity-Constrained and Noisy Group Testing

Eric Price, Jonathan Scarlett, Nelvin Tan

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether at least one defective item is pre…

cs.DS2020★ 4 cited

Near optimal sparsity-constrained group testing: improved bounds and algorithms

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk +4

Recent advances in noiseless non-adaptive group testing have led to a precise asymptotic characterization of the number of tests required for high-probability recovery in the subli…

cs.IT2020★ 1 cited

Improved Bounds and Algorithms for Sparsity-Constrained Group Testing

Nelvin Tan, Jonathan Scarlett

In group testing, the goal is to identify a subset of defective items within a larger set of items based on tests whose outcomes indicate whether any defective item is present. Thi…