Harnessing the power of sample abundance: Theoretical guarantees and algorithms for accelerated one-bit sensing

A Eamaz, F Yeganegi, D Needell… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
One-bit quantization with time-varying sampling thresholds (also known as random
dithering) has recently found significant utilization potential in statistical signal processing …

Sample complexity bounds for 1-bit compressive sensing and binary stable embeddings with generative priors

Z Liu, S Gomes, A Tiwari… - … Conference on Machine …, 2020 - proceedings.mlr.press
The goal of standard 1-bit compressive sensing is to accurately recover an unknown sparse
vector from binary-valued measurements, each indicating the sign of a linear function of the …

Binary iterative hard thresholding converges with optimal number of measurements for 1-bit compressed sensing

N Matsumoto, A Mazumdar - Journal of the ACM, 2024 - dl.acm.org
Compressed sensing has been a very successful high-dimensional signal acquisition and
recovery technique that relies on linear operations. However, the actual measurements of …

Computing one-bit compressive sensing via double-sparsity constrained optimization

S Zhou, Z Luo, N Xiu, GY Li - IEEE Transactions on Signal …, 2022 - ieeexplore.ieee.org
One-bit compressive sensing gains its popularity in signal processing and communications
due to its low storage costs and low hardware complexity. However, it has been a …

Support recovery in universal one-bit compressed sensing

A Mazumdar, S Pal - arXiv preprint arXiv:2107.09091, 2021 - arxiv.org
One-bit compressed sensing (1bCS) is an extreme-quantized signal acquisition method that
has been intermittently studied in the past decade. In 1bCS, linear samples of a high …

Support recovery of sparse signals from a mixture of linear measurements

S Pal, A Mazumdar… - Advances in Neural …, 2021 - proceedings.neurips.cc
Recovery of support of a sparse vector from simple measurements is a widely studied
problem, considered under the frameworks of compressed sensing, 1-bit compressed …

Recovery of sparse linear classifiers from mixture of responses

V Gandikota, A Mazumdar… - Advances in Neural …, 2020 - proceedings.neurips.cc
In the problem of learning a mixture of linear classifiers, the aim is to learn a collection of
hyperplanes from a sequence of binary responses. Each response is a result of querying …

Robust 1-bit Compressed Sensing with Iterative Hard Thresholding

N Matsumoto, A Mazumdar - Proceedings of the 2024 Annual ACM-SIAM …, 2024 - SIAM
In 1-bit compressed sensing, the aim is to estimate ak-sparse unit vector x∈ Sn-1 within an
e error (in ℓ2) from minimal number of linear measurements that are quantized to just their …

Sparse affine sampling: Ambiguity-free and efficient sparse phase retrieval

MH Yang, YWP Hong, JY Wu - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Conventional sparse phase retrieval schemes can recover sparse signals from the
magnitude of linear measurements only up to a global phase ambiguity. This work proposes …

Improved support recovery in universal one-bit compressed sensing

N Matsumoto, A Mazumdar, S Pal - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
One-bit compressed sensing (1bCS) is an extremely quantized signal acquisition method
that has been proposed and studied rigorously in the past decade. In 1bCS, linear samples …