Approximate Message Passing with Parameter Estimation for Heavily Quantized Measurements
Not on the map. Why?
Abstract (arXiv)
Designing efficient sparse recovery algorithms that could handle noisy quantized measurements is important in a variety of applications -- from radar to source localization, spectrum sensing and wireless networking. We take advantage of the approximate message passing (AMP) framework to achieve this goal given its high computational efficiency and state-of-the-art performance. In AMP, the signal of interest is assumed to follow certain prior distribution with unknown parameters. Previous works focused on finding the parameters that maximize the measurement likelihood via expectation maximization -- an increasingly difficult problem to solve in cases involving complicated probability models. In this paper, we treat the parameters as unknown variables and compute their posteriors via AMP. The parameters and signal of interest can then be jointly recovered. Compared to previous methods, the proposed approach leads to a simple and elegant parameter estimation scheme, allowing us to directly work with 1-bit quantization noise model. We then further extend our approach to general multi-bit quantization noise model. Experimental results show that the proposed framework provides significant improvement over state-of-the-art methods across a wide range of sparsity and noise levels.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 2 of its 69 references that are in the map. First posted on arXiv 20 May 2022.
Builds on
2 of 69 references.
References · 2
- 2014From Denoising to Compressed Sensingcited by 68
- 2015When Are Nonconvex Problems Not Scary?cited by 28
Built on by
Citing papers per year: 2023: 1.
1 paper.
- 2023Estimation of embedding vectors in high dimensionscited by 0
- 2023Estimation of embedding vectors in high dimensions12 Dec 2023
Similar, not cited
Close in wording, no citation either way
- 2022A Unitary Transform Based Generalized Approximate Message Passing
- 2023One-Bit Quadratic Compressed Sensing: From Sample Abundance to Linear Feasibility
- 2024Multi-bit Distributed Detection of Sparse Stochastic Signals over Error-Prone Reporting Channels
- 2022Quantizing Heavy-tailed Data in Statistical Estimation: (Near) Minimax Rates, Covariate Quantization, and Uniform Recovery
- 2022Improved Support Recovery in Universal One-bit Compressed Sensing
- 2025MCRB for Parameter Estimation from One-Bit Quantized and Oversampled Measurements
- 2025Exact Recovery of Sparse Binary Vectors from Generalized Linear Measurements
- 2026Recovery Guarantees for Posterior Sampling of One-Bit Compressed Sensing