Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
194 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Harnessing the Power of Sample Abundance: Theoretical Guarantees and Algorithms for Accelerated One-Bit Sensing (2308.00695v4)

Published 1 Aug 2023 in cs.IT and math.IT

Abstract: One-bit quantization with time-varying sampling thresholds (also known as random dithering) has recently found significant utilization potential in statistical signal processing applications due to its relatively low power consumption and low implementation cost. In addition to such advantages, an attractive feature of one-bit analog-to-digital converters (ADCs) is their superior sampling rates as compared to their conventional multi-bit counterparts. This characteristic endows one-bit signal processing frameworks with what one may refer to as sample abundance. We show that sample abundance plays a pivotal role in many signal recovery and optimization problems that are formulated as (possibly non-convex) quadratic programs with linear feasibility constraints. Of particular interest to our work are low-rank matrix recovery and compressed sensing applications that take advantage of one-bit quantization. We demonstrate that the sample abundance paradigm allows for the transformation of such problems to merely linear feasibility problems by forming large-scale overdetermined linear systems -- thus removing the need for handling costly optimization constraints and objectives. To make the proposed computational cost savings achievable, we offer enhanced randomized Kaczmarz algorithms to solve these highly overdetermined feasibility problems and provide theoretical guarantees in terms of their convergence, sample size requirements, and overall performance. Several numerical results are presented to illustrate the effectiveness of the proposed methodologies.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (54)
  1. “Phase retrieval via matrix completion,” SIAM review, vol. 57, no. 2, pp. 225–251, 2015.
  2. M. A. Davenport and J. Romberg, “An overview of low-rank matrix recovery from incomplete observations,” IEEE Journal of Selected Topics in Signal Processing, vol. 10, no. 4, pp. 608–622, 2016.
  3. E.J. Candes and Y. Plan, “Tight oracle inequalities for low-rank matrix recovery from a minimal number of noisy random measurements,” IEEE Transactions on Information Theory, vol. 57, no. 4, pp. 2342–2359, 2011.
  4. “Null space conditions and thresholds for rank minimization,” Mathematical programming, vol. 127, no. 1, pp. 175–202, 2011.
  5. “Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information,” IEEE Transactions on information theory, vol. 52, no. 2, pp. 489–509, 2006.
  6. “Quantization and compressive sensing,” in Compressed Sensing and its Applications: MATHEON Workshop 2013. Springer, 2015, pp. 193–237.
  7. “Modified arcsine law for one-bit sampled stationary signals with time-varying thresholds,” in ICASSP 2021-2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP). IEEE, 2021, pp. 5459–5463.
  8. “PhaseLift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics, vol. 66, no. 8, pp. 1241–1274, 2013.
  9. “One-bit phase retrieval: More samples means less complexity?,” IEEE Transactions on Signal Processing, vol. 70, pp. 4618–4632, 2022.
  10. A. Mezghani and A. L. Swindlehurst, “Blind estimation of sparse broadband massive MIMO channels with ideal and one-bit ADCs,” IEEE Transactions on Signal Processing, vol. 66, no. 11, pp. 2972–2983, 2018.
  11. “One-bit compressive sensing with norm estimation,” IEEE Transactions on Information Theory, vol. 62, no. 5, pp. 2748–2758, 2016.
  12. O. Dabeer and A. Karnik, “Signal parameter estimation using 1-bit dithered quantization,” IEEE Transactions on Information Theory, vol. 52, no. 12, pp. 5389–5405, 2006.
  13. P. Carbone, “Quantitative criteria for the design of dither-based quantizing systems,” IEEE Transactions on Instrumentation and Measurement, vol. 46, no. 3, pp. 656–659, 1997.
  14. “Analog to digital conversion using differential dither,” May 21 2019, US Patent 10,298,256.
  15. “Covariance recovery for one-bit sampled stationary signals with time-varying sampling thresholds,” Signal Processing, vol. 206, pp. 108899, 2023.
  16. “Covariance recovery for one-bit sampled non-stationary signals with time-varying sampling thresholds,” IEEE Transactions on Signal Processing, vol. 70, pp. 5222–5236, 2022.
  17. “Covariance estimation under one-bit quantization,” The Annals of Statistics, vol. 50, no. 6, pp. 3538–3562, 2022.
  18. “UNO: Unlimited sampling meets one-bit quantization,” arXiv preprint arXiv:2301.10155, 2022.
  19. P. Martinsson and J.A. Tropp, “Randomized numerical linear algebra: Foundations and algorithms,” Acta Numerica, vol. 29, pp. 403–572, 2020.
  20. T. Strohmer and R. Vershynin, “A randomized Kaczmarz algorithm with exponential convergence,” Journal of Fourier Analysis and Applications, vol. 15, no. 2, pp. 262–278, 2009.
  21. D. Leventhal and A. S. Lewis, “Randomized methods for linear constraints: convergence rates and conditioning,” Mathematics of Operations Research, vol. 35, no. 3, pp. 641–654, 2010.
  22. “Convergence properties of the randomized extended Gauss-Seidel and Kaczmarz methods,” SIAM Journal on Matrix Analysis and Applications, vol. 36, no. 4, pp. 1590–1604, 2015.
  23. S. Kaczmarz, “Angenäherte auflösung von systemen linearer gleichungen,” Bulletin International de l’Académie Polonaise des Sciences et des Lettres, vol. 35, pp. 355–357, 1937, in German; English translation by Jason Stockmann: “Approximate solution of systems of linear equations”.
  24. D. Needell and J.A. Tropp, “Paved with good intentions: Analysis of a randomized block Kaczmarz method,” Linear Algebra and its Applications, vol. 441, pp. 199–221, 2014.
  25. “A sampling Kaczmarz–Motzkin algorithm for linear feasibility,” SIAM Journal on Scientific Computing, vol. 39, no. 5, pp. S66–S87, 2017.
  26. S. Foucart and R. G Lynch, “Recovering low-rank matrices from binary measurements,” Inverse Problems & Imaging, vol. 13, no. 4, 2019.
  27. “1-bit compressive sensing,” in 2008 42nd Annual Conference on Information Sciences and Systems. IEEE, 2008, pp. 16–21.
  28. “Robust 1-bit compressive sensing via binary stable embeddings of sparse vectors,” IEEE Transactions on Information Theory, vol. 59, no. 4, pp. 2082–2102, 2013.
  29. Y. Plan and R. Vershynin, “One-bit compressed sensing by linear programming,” Communications on Pure and Applied Mathematics, vol. 66, no. 8, pp. 1275–1297, 2013.
  30. “Quantized iterative hard thresholding: Bridging 1-bit and high-resolution quantized compressed sensing,” arXiv preprint arXiv:1305.1786, 2013.
  31. “NBIHT: An efficient algorithm for 1-bit compressed sensing with optimal error decay rate,” IEEE Transactions on Information Theory, vol. 68, no. 2, pp. 1157–1177, 2021.
  32. “One-bit compressed sensing with non-Gaussian measurements,” Linear Algebra and its Applications, vol. 441, pp. 222–239, 2014.
  33. “One-bit compressive sensing with projected subgradient method under sparsity constraints,” IEEE Transactions on Information Theory, vol. 65, no. 10, pp. 6650–6663, 2019.
  34. Y. Plan and R. Vershynin, “Dimension reduction by random hyperplane tessellations,” Discrete & Computational Geometry, vol. 51, no. 2, pp. 438–461, 2014.
  35. S. Oymak and B. Recht, “Near-optimal bounds for binary embeddings of arbitrary sets,” arXiv preprint arXiv:1512.04433, 2015.
  36. “Exponential decay of reconstruction error from binary measurements of sparse signals,” IEEE Transactions on Information Theory, vol. 63, no. 6, pp. 3368–3385, 2017.
  37. C. Xu and L. Jacques, “Quantized compressive sensing with RIP matrices: The benefit of dithering,” Information and Inference: A Journal of the IMA, vol. 9, no. 3, pp. 543–586, 2020.
  38. L. Jacques, “Small width, low distortions: quantized random embeddings of low-complexity sets,” IEEE Transactions on information theory, vol. 63, no. 9, pp. 5477–5495, 2017.
  39. M. Dereziński and E. Rebrova, “Sharp analysis of sketch-and-project methods via a connection to randomized singular value decomposition,” arXiv preprint arXiv:2208.09585, 2022.
  40. C. Thrampoulidis and A. S. Rawat, “The generalized LASSO for sub-Gaussian measurements with dithered quantization,” IEEE Transactions on Information Theory, vol. 66, no. 4, pp. 2487–2500, 2020.
  41. “Sharp estimates on random hyperplane tessellations,” SIAM Journal on Mathematics of Data Science, vol. 4, no. 4, pp. 1396–1419, 2022.
  42. “ε𝜀\varepsilonitalic_ε-entropy and ε𝜀\varepsilonitalic_ε-capacity of sets in function spaces,” Uspekhi Matematicheskikh Nauk, vol. 14, no. 2, pp. 3–86, 1959.
  43. V. Rokhlin and M. Tygert, “A fast randomized algorithm for overdetermined linear least-squares regression,” Proceedings of the National Academy of Sciences, vol. 105, no. 36, pp. 13212–13217, 2008.
  44. D.P Woodruff, “Sketching as a tool for numerical linear algebra,” Foundations and Trends® in Theoretical Computer Science, vol. 10, no. 1–2, pp. 1–157, 2014.
  45. D. Needell, “Randomized Kaczmarz solver for noisy linear systems,” BIT Numerical Mathematics, vol. 50, pp. 395–403, 2010.
  46. M. Huang and Y. Wang, “Linear convergence of randomized Kaczmarz method for solving complex-valued phaseless equations,” SIAM Journal on Imaging Sciences, vol. 15, no. 2, pp. 989–1016, 2022.
  47. “A singular value thresholding algorithm for matrix completion,” SIAM Journal on optimization, vol. 20, no. 4, pp. 1956–1982, 2010.
  48. “Nonconvex optimization meets low-rank matrix factorization: An overview,” IEEE Transactions on Signal Processing, vol. 67, no. 20, pp. 5239–5269, 2019.
  49. R. Escalante and M. Raydan, Alternating projection methods, SIAM, 2011.
  50. “On the number of faces and radii of cells induced by gaussian spherical tessellations,” Applied and Computational Harmonic Analysis, vol. 56, pp. 176–188, 2022.
  51. L. Jacques and V. Cambareri, “Time for dithering: fast and quantized random embeddings via the restricted isometry property,” Information and Inference: A Journal of the IMA, vol. 6, no. 4, pp. 441–476, 2017.
  52. E. Rebrova and D. Needell, “On block Gaussian sketching for the Kaczmarz method,” Numerical Algorithms, vol. 86, pp. 443–473, 2021.
  53. R. Vershynin, High-dimensional probability: An introduction with applications in data science, vol. 47, Cambridge university press, 2018.
  54. “Operator-Lipschitz estimates for the singular value functional calculus,” Proceedings of the American Mathematical Society, vol. 144, no. 5, pp. 1867–1875, 2016.
Citations (10)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now