Robust one-bit compressed sensing with partial circulant matrices

We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly sub-sampled circulant matrix) and is robust to analog pre-quantization noise as well as to adversarial bit corruptions in the quantization process. Our results imply that quantization is not a statistically expensive procedure in the presence of nontrivial analog noise: recovery requires the same sample size one would have needed had the measurement matrix been Gaussian and the noisy analog measurements been given as data.

[1]  Rayan Saab,et al.  Fast Binary Embeddings and Quantized Compressed Sensing with Structured Matrices , 2018, Communications on Pure and Applied Mathematics.

[2]  M. Talagrand,et al.  Probability in Banach spaces , 1991 .

[3]  Shahar Mendelson,et al.  `local' vs. `global' parameters -- breaking the gaussian complexity barrier , 2015, 1504.02191.

[4]  B. Carl.  Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces , 1985 .

[5]  Sjoerd Dirksen,et al.  Quantized Compressed Sensing: A Survey , 2019, Applied and Numerical Harmonic Analysis.

[6]  Justin K. Romberg,et al.  Compressive Sensing by Random Convolution , 2009, SIAM J. Imaging Sci..

[7]  Sjoerd Dirksen,et al.  Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing , 2018, Journal of the European Mathematical Society.

[8]  Holger Rauhut,et al.  Improved bounds for sparse recovery from subsampled random convolutions , 2016, The Annals of Applied Probability.

[9]  Richard G. Baraniuk,et al.  1-Bit compressive sensing , 2008, 2008 42nd Annual Conference on Information Sciences and Systems.

[10]  Yaniv Plan,et al.  Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach , 2012, IEEE Transactions on Information Theory.

[11]  E. Giné,et al.  Some Limit Theorems for Empirical Processes , 1984 .

[12]  Yaniv Plan,et al.  One-bit compressed sensing with non-Gaussian measurements , 2012, ArXiv.

[13]  慧 廣瀬.  A Mathematical Introduction to Compressive Sensing , 2015 .

[14]  Holger Rauhut,et al.  One-bit compressed sensing with partial Gaussian circulant matrices , 2017, Information and Inference: A Journal of the IMA.

[15]  Bo'az Klartag.  $5n$ Minkowski symmetrizations suffice to arrive at an approximate Euclidean ball , 2002 .

[16]  Laurent Jacques,et al.  Quantized Compressive Sensing with RIP Matrices: The Benefit of Dithering , 2018, Information and Inference: A Journal of the IMA.

[17]  Robert W. Heath,et al.  Capacity Analysis of One-Bit Quantized MIMO Systems With Transmitter Channel State Information , 2014, IEEE Transactions on Signal Processing.

[18]  Rayan Saab,et al.  Quantized compressed sensing for partial random circulant matrices , 2017, 2017 International Conference on Sampling Theory and Applications (SampTA).

[19]  Richard G. Baraniuk,et al.  Exponential Decay of Reconstruction Error From Binary Measurements of Sparse Signals , 2014, IEEE Transactions on Information Theory.