One-Bit Sensing of Low-Rank and Bisparse Matrices

This note studies the worst-case recovery error of lowrank and bisparse matrices as a function of the number of one-bit measurements used to acquire them. First, by way of the concept of consistency width, precise estimates are given on how fast the recovery error can in theory decay. Next, an idealized recovery method is proved to reach the fourth-root of the optimal decay rate for Gaussian sensing schemes. This idealized method being impractical, an implementable recovery algorithm is finally proposed in the context of factorized Gaussian sensing schemes. It is shown to provide a recovery error decaying as the sixth-root of the optimal rate.

[1]  Yonina C. Eldar,et al.  Simultaneously Structured Models With Application to Sparse and Low-Rank Matrices , 2012, IEEE Transactions on Information Theory.

[2]  Simon Foucart,et al.  Flavors of Compressive Sensing , 2016 .

[3]  Simon Foucart,et al.  Recovering low-rank matrices from binary measurements , 2019, Inverse Problems & Imaging.

[4]  Laurent Jacques,et al.  Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors , 2011, IEEE Transactions on Information Theory.

[5]  Emmanuel J. Candès,et al.  Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements , 2011, IEEE Transactions on Information Theory.

[6]  S. Foucart,et al.  Jointly low-rank and bisparse recovery: Questions and partial answers , 2019, Analysis and Applications.

[7]  Justin K. Romberg,et al.  Near-Optimal Estimation of Simultaneously Sparse and Low-Rank Matrices from Nested Linear Measurements , 2015, ArXiv.

[8]  Richard G. Baraniuk,et al.  One-Bit Compressive Sensing of Dictionary-Sparse Signals , 2016, ArXiv.

[9]  Dmitriy Bilyk,et al.  Random Tessellations, Restricted Isometric Embeddings, and One Bit Sensing , 2015, ArXiv.

[10]  Yaniv Plan,et al.  Dimension Reduction by Random Hyperplane Tessellations , 2014, Discret. Comput. Geom..

[11]  Benjamin Recht,et al.  Near-Optimal Bounds for Binary Embeddings of Arbitrary Sets , 2015, ArXiv.

[12]  G. Schechtman.  Two observations regarding embedding subsets of Euclidean spaces in normed spaces , 2006 .

[13]  Yang Wang,et al.  Robust sparse phase retrieval made easy , 2014, 1410.5295.

[14]  Laurent Jacques,et al.  Error Decay of (Almost) Consistent Signal Estimations From Quantized Gaussian Random Projections , 2014, IEEE Transactions on Information Theory.