Enregistré dans:
| Auteur principal: | |
|---|---|
| Format: | Preprint |
| Publié: |
2024
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2409.06320 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866909502679285760 |
|---|---|
| author | Takeuchi, Keigo |
| author_facet | Takeuchi, Keigo |
| contents | This paper addresses the reconstruction of an unknown signal vector with sublinear sparsity from generalized linear measurements. Generalized approximate message-passing (GAMP) is proposed via state evolution in the sublinear sparsity limit, where the signal dimension $N$, measurement dimension $M$, and signal sparsity $k$ satisfy $\log k/\log N\to γ\in[0, 1)$ and $M/\{k\log (N/k)\}\toδ$ as $N$ and $k$ tend to infinity. While the overall flow in state evolution is the same as that for linear sparsity, each proof step for inner denoising requires stronger assumptions than those for linear sparsity. The required new assumptions are proved for Bayesian inner denoising. When Bayesian outer and inner denoisers are used in GAMP, the obtained state evolution recursion is utilized to evaluate the prefactor $δ$ in the sample complexity, called reconstruction threshold. If and only if $δ$ is larger than the reconstruction threshold, Bayesian GAMP can achieve asymptotically exact signal reconstruction. In particular, the reconstruction threshold is finite for noisy linear measurements when the support of non-zero signal elements does not include a neighborhood of zero. As numerical examples, this paper considers linear measurements and 1-bit compressed sensing. Numerical simulations for both cases show that Bayesian GAMP outperforms existing algorithms for sublinear sparsity in terms of the sample complexity. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_06320 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Generalized Approximate Message-Passing for Compressed Sensing with Sublinear Sparsity Takeuchi, Keigo Information Theory This paper addresses the reconstruction of an unknown signal vector with sublinear sparsity from generalized linear measurements. Generalized approximate message-passing (GAMP) is proposed via state evolution in the sublinear sparsity limit, where the signal dimension $N$, measurement dimension $M$, and signal sparsity $k$ satisfy $\log k/\log N\to γ\in[0, 1)$ and $M/\{k\log (N/k)\}\toδ$ as $N$ and $k$ tend to infinity. While the overall flow in state evolution is the same as that for linear sparsity, each proof step for inner denoising requires stronger assumptions than those for linear sparsity. The required new assumptions are proved for Bayesian inner denoising. When Bayesian outer and inner denoisers are used in GAMP, the obtained state evolution recursion is utilized to evaluate the prefactor $δ$ in the sample complexity, called reconstruction threshold. If and only if $δ$ is larger than the reconstruction threshold, Bayesian GAMP can achieve asymptotically exact signal reconstruction. In particular, the reconstruction threshold is finite for noisy linear measurements when the support of non-zero signal elements does not include a neighborhood of zero. As numerical examples, this paper considers linear measurements and 1-bit compressed sensing. Numerical simulations for both cases show that Bayesian GAMP outperforms existing algorithms for sublinear sparsity in terms of the sample complexity. |
| title | Generalized Approximate Message-Passing for Compressed Sensing with Sublinear Sparsity |
| topic | Information Theory |
| url | https://arxiv.org/abs/2409.06320 |