One-bit Compressed Sensing using Generative Models
Not on the map. Why?
Abstract (arXiv)
This paper addresses the classical problem of one-bit compressed sensing using a deep learning-based reconstruction algorithm that leverages a trained generative model to enhance the signal reconstruction performance. The generator, a pre-trained neural network, learns to map from a low-dimensional latent space to a higher-dimensional set of sparse vectors. This generator is then used to reconstruct sparse vectors from their one-bit measurements by searching over its range. The presented algorithm provides an excellent reconstruction performance because the generative model can learn additional structural information about the signal beyond sparsity. Furthermore, we provide theoretical guarantees on the reconstruction accuracy and sample complexity of the algorithm. Through numerical experiments using three publicly available image datasets, MNIST, Fashion-MNIST, and Omniglot, we demonstrate the superior performance of the algorithm compared to other existing algorithms and show that our algorithm can recover both the amplitude and the direction of the signal from one-bit measurements.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 9 of its 53 references that are in the map. First posted on arXiv 18 Feb 2025.
Builds on
9 of 53 references.
References · 9
- 2014Adam: A Method for Stochastic Optimizationcited by 37,093
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,328
- 2017Compressed Sensing using Generative Modelscited by 339
- 2020Sample Complexity Bounds for 1-bit Compressive Sensing and Binary Stable Embeddings with Generative Priorscited by 21
- 2014One-bit compressive sensing with norm estimationcited by 12
- 2018Deep Signal Recovery with One-Bit Quantizationcited by 8
- 2019One-Bit Radar Processing with Time-Varying Sampling Thresholdscited by 7
- 2021Robust 1-bit Compressive Sensing with Partial Gaussian Circulant Matrices and Generative Priorscited by 7
- 2014Binary Linear Classification and Feature Selection via Generalized Approximate Message Passingcited by 2
Built on by
Citing papers per year: 2026: 1.
1 paper.