Convex Quantization Preserves Logconcavity
arXiv:2206.05598 · doi:10.1109/LSP.2022.3233001
Abstract
A logconcave likelihood is as important to proper statistical inference as a convex cost function is important to variational optimization. Quantization is often disregarded when writing likelihood models, ignoring the limitations of the physical detectors used to collect the data. These two facts call for the question: would including quantization in likelihood models preclude logconcavity? are the true data likelihoods logconcave? We provide a general proof that the same simple assumption that leads to logconcave continuous-data likelihoods also leads to logconcave quantized-data likelihoods, provided that convex quantization regions are used.
arXiv comment5 pages, Accepted in the IEEE Signal Processing Letters
References in corpus (6)
- Bayes-Optimal Joint Channel-and-Data Estimation for Massive MIMO with Low-Precision ADCs
- Performance Analysis for Channel Estimation with 1-bit ADC and Unknown Quantization Threshold
- Deep Signal Recovery with One-Bit Quantization
- Log-concavity property of the error probability with application to local bounds for wireless communications
- Dictionary Learning for Blind One Bit Compressed Sensing
- Decentralized Sequential Composite Hypothesis Test Based on One-Bit Communication