Towards a Lower Sample Complexity for Robust One-bit Compressed Sensing

Rongda Zhu, Quanquan Gu

Abstract: In this paper, we propose a novel algorithm based on nonconvex sparsity-inducing penalty for one-bit compressed sensing. We prove that our algorithm has a sample complexity of O(s/ε^2) for strong s...