Arya Mazumdar

2 papers indexed

arxivcs.ITcs.DSmath.STstat.ML2026-07-17

On the Role of Normalization in Binary Iterative Hard Thresholding for 1-bit Compressed Sensing

Binary Iterative Hard Thresholding (BIHT) is a simple, yet effective, greedy method for recovering a sparse vector from one-bit sign measurements. In its original form, BIHT performs a ``gradient-descent'' step, followed by hard thresholding. A convergence analysis of this algori…

View free PDFSource page

arxivcs.ITeess.SP2026-07-07

Near-Optimal Lower Bounds on One-Bit Compressed Sensing of Approximately Sparse Signals

Junren Chen, Arya Mazumdar, Ming Yuan

This paper provides the first near-optimal lower bounds for one-bit compressed sensing of approximately sparse signals lying in a scaled $\ell_1$ ball, which is a commonly adopted relaxation of the exactly $k$-sparse assumption. In prior works, the best known upper bounds on unif…

View free PDFSource page