Preprint
Jul 2026
On the Role of Normalization in Binary Iterative Hard Thresholding for 1-bit Compressed Sensing
A universal, sample-optimal convergence theorem for the original BIHT algorithm is proved and a scalar lower bound is proved showing that any nontrivial corruption pattern, even one that involves only one flipped sign together with one clean sign, forces the iterates to oscillate indefinitely.
Arya Mazumdar, Prateeti Mukherjee
· 0 citations