Nelvin Tan

According to our database, Nelvin Tan authored at least 11 papers between 2020 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

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

Nelvin Tan, Pablo Pascual Cobo, Jonathan Scarlett, Ramji Venkataramanan

SIAM J. Math. Data Sci., 2024

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

Nelvin Tan, Pablo Pascual Cobo, Ramji Venkataramanan

CoRR, 2024

2023

Performance Bounds for Group Testing With Doubly-Regular Designs.

Nelvin Tan, Way Tan, Jonathan Scarlett

IEEE Trans. Inf. Theory, February, 2023

Mixed Regression via Approximate Message Passing.

Nelvin Tan, Ramji Venkataramanan

J. Mach. Learn. Res., 2023

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

Nelvin Tan, Jonathan Scarlett, Ramji Venkataramanan

CoRR, 2023

Mixed Linear Regression via Approximate Message Passing.

Nelvin Tan, Ramji Venkataramanan

Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

2022

Near-Optimal Sparsity-Constrained Group Testing: Improved Bounds and Algorithms.

Oliver Gebhard, Max Hahn-Klimroth, Olaf Parczyk, Manuel Penschuck, Maurice Rolvien, Jonathan Scarlett, Nelvin Tan

IEEE Trans. Inf. Theory, 2022

2021

Fast Splitting Algorithms for Sparsity-Constrained and Noisy Group Testing.

Eric Price, Jonathan Scarlett, Nelvin Tan

CoRR, 2021

An Analysis of the DD Algorithm for Group Testing with Size-Constrained Tests.

Nelvin Tan, Jonathan Scarlett

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Improved Bounds and Algorithms for Sparsity-Constrained Group Testing.

Nelvin Tan, Jonathan Scarlett

CoRR, 2020

Near-Optimal Sparse Adaptive Group Testing.

Nelvin Tan, Jonathan Scarlett

Proceedings of the IEEE International Symposium on Information Theory, 2020