Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.04951 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916708144381952 |
|---|---|
| author | Chen, Junren Yuan, Ming |
| author_facet | Chen, Junren Yuan, Ming |
| contents | This paper provides a unified treatment to the recovery of structured signals living in a star-shaped set from general quantized measurements $\mathcal{Q}(\mathbf{A}\mathbf{x}-\mathbfτ)$, where $\mathbf{A}$ is a sensing matrix, $\mathbfτ$ is a vector of (possibly random) quantization thresholds, and $\mathcal{Q}$ denotes an $L$-level quantizer. The ideal estimator with consistent quantized measurements is optimal in some important instances but typically infeasible to compute. To this end, we study the projected gradient descent (PGD) algorithm with respect to the one-sided $\ell_1$-loss and identify the conditions under which PGD achieves the same error rate, up to logarithmic factors. These conditions include estimates of the separation probability, small-ball probability and some moment bounds that are easy to validate. For multi-bit case, we also develop a complementary approach based on product embedding to show global convergence. When applied to popular models such as 1-bit compressed sensing with Gaussian $\mathbf{A}$ and zero $\mathbfτ$ and the dithered 1-bit/multi-bit models with sub-Gaussian $\mathbf{A}$ and uniform dither $\mathbfτ$, our unified treatment yields error rates that improve on or match the sharpest results in all instances. Particularly, PGD achieves the information-theoretic optimal rate $\tilde{O}(\frac{k}{mL})$ for recovering $k$-sparse signals, and the rate $\tilde{O}((\frac{k}{mL})^{1/3})$ for effectively sparse signals. For 1-bit compressed sensing of sparse signals, our result recovers the optimality of normalized binary iterative hard thresholding (NBIHT) that was proved very recently. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_04951 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Optimal Quantized Compressed Sensing via Projected Gradient Descent Chen, Junren Yuan, Ming Information Theory This paper provides a unified treatment to the recovery of structured signals living in a star-shaped set from general quantized measurements $\mathcal{Q}(\mathbf{A}\mathbf{x}-\mathbfτ)$, where $\mathbf{A}$ is a sensing matrix, $\mathbfτ$ is a vector of (possibly random) quantization thresholds, and $\mathcal{Q}$ denotes an $L$-level quantizer. The ideal estimator with consistent quantized measurements is optimal in some important instances but typically infeasible to compute. To this end, we study the projected gradient descent (PGD) algorithm with respect to the one-sided $\ell_1$-loss and identify the conditions under which PGD achieves the same error rate, up to logarithmic factors. These conditions include estimates of the separation probability, small-ball probability and some moment bounds that are easy to validate. For multi-bit case, we also develop a complementary approach based on product embedding to show global convergence. When applied to popular models such as 1-bit compressed sensing with Gaussian $\mathbf{A}$ and zero $\mathbfτ$ and the dithered 1-bit/multi-bit models with sub-Gaussian $\mathbf{A}$ and uniform dither $\mathbfτ$, our unified treatment yields error rates that improve on or match the sharpest results in all instances. Particularly, PGD achieves the information-theoretic optimal rate $\tilde{O}(\frac{k}{mL})$ for recovering $k$-sparse signals, and the rate $\tilde{O}((\frac{k}{mL})^{1/3})$ for effectively sparse signals. For 1-bit compressed sensing of sparse signals, our result recovers the optimality of normalized binary iterative hard thresholding (NBIHT) that was proved very recently. |
| title | Optimal Quantized Compressed Sensing via Projected Gradient Descent |
| topic | Information Theory |
| url | https://arxiv.org/abs/2407.04951 |