Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
From MaRDI portal
Publication:5346265
Abstract: We study the compressed sensing reconstruction problem for a broad class of random, band-diagonal sensing matrices. This construction is inspired by the idea of spatial coupling in coding theory. As demonstrated heuristically and numerically by Krzakala et al. cite{KrzakalaEtAl}, message passing algorithms can effectively solve the reconstruction problem for spatially coupled measurements with undersampling rates close to the fraction of non-zero coordinates. We use an approximate message passing (AMP) algorithm and analyze it through the state evolution method. We give a rigorous proof that this approach is successful as soon as the undersampling rate exceeds the (upper) R'enyi information dimension of the signal, . More precisely, for a sequence of signals of diverging dimension whose empirical distribution converges to , reconstruction is with high probability successful from measurements taken according to a band diagonal matrix. For sparse signals, i.e., sequences of dimension and non-zero entries, this implies reconstruction from measurements. For `discrete' signals, i.e., signals whose coordinates take a fixed finite set of values, this implies reconstruction from measurements. The result is robust with respect to noise, does not apply uniquely to random signals, but requires the knowledge of the empirical distribution of the signal .
Cited in
(22)- Sparse high-dimensional linear regression. Estimating squared error and a phase transition
- A Unifying Tutorial on Approximate Message Passing
- Universality of approximate message passing algorithms
- Message-Passing De-Quantization With Applications to Compressed Sensing
- Multi-layer state evolution under random convolutional design
- Approximate message-passing with spatially coupled structured operators, with applications to compressed sensing and sparse superposition codes
- Approximate message passing algorithms for rotationally invariant matrices
- Marginals of a spherical spin Glass model with correlated disorder
- Weak-type estimates for the metaplectic representation restricted to the shearing and dilation subgroup of \(\mathrm{SL}(2,\mathbb{R})\)
- Universality of approximate message passing algorithms and tensor networks
- Precise statistical analysis of classification accuracies for adversarial training
- Typical reconstruction limits for distributed compressed sensing based on \(\ell_{2,1} \)-norm minimization and Bayesian optimal reconstruction
- Optimal group testing
- Decoding from pooled data: sharp information-theoretic bounds
- Approximate message passing with spectral initialization for generalized linear models*
- Perturbative construction of mean-field equations in extensive-rank matrix factorization and denoising
- Spatially Coupled Ensembles Universally Achieve Capacity Under Belief Propagation
- Fundamental limits of weak recovery with applications to phase retrieval
- Approximate message passing with rigorous guarantees for pooled data and quantitative group testing
- Universality in polytope phase transitions and message passing algorithms
- On convergence of the cavity and Bolthausen's TAP iterations to the local magnetization
- On reconstructing functions from binary measurements
This page was built for publication: Information-Theoretically Optimal Compressed Sensing via Spatial Coupling and Approximate Message Passing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346265)