Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 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

Matrix Completion from One-Bit Dither Samples (2310.03224v2)

Published 5 Oct 2023 in cs.IT, eess.SP, and math.IT

Abstract: We explore the impact of coarse quantization on matrix completion in the extreme scenario of dithered one-bit sensing, where the matrix entries are compared with time-varying threshold levels. In particular, instead of observing a subset of high-resolution entries of a low-rank matrix, we have access to a small number of one-bit samples, generated as a result of these comparisons. In order to recover the low-rank matrix using its coarsely quantized known entries, we begin by transforming the problem of one-bit matrix completion (one-bit MC) with time-varying thresholds into a nuclear norm minimization problem. The one-bit sampled information is represented as linear inequality feasibility constraints. We then develop the popular singular value thresholding (SVT) algorithm to accommodate these inequality constraints, resulting in the creation of the One-Bit SVT (OB-SVT). Our findings demonstrate that incorporating multiple time-varying sampling threshold sequences in one-bit MC can significantly improve the performance of the matrix completion algorithm. In pursuit of achieving this objective, we utilize diverse thresholding schemes, namely uniform, Gaussian, and discrete thresholds. To accelerate the convergence of our proposed algorithm, we introduce three variants of the OB-SVT algorithm. Among these variants is the randomized sketched OB-SVT, which departs from using the entire information at each iteration, opting instead to utilize sketched data. This approach effectively reduces the dimension of the operational space and accelerates the convergence. We perform numerical evaluations comparing our proposed algorithm with the maximum likelihood estimation method previously employed for one-bit MC, and demonstrate that our approach can achieve a better recovery performance.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (47)
  1. Y. Chi, Y. Lu, and Y. Chen, “Nonconvex optimization meets low-rank matrix factorization: An overview,” IEEE Transactions on Signal Processing, vol. 67, no. 20, pp. 5239–5269, 2019.
  2. E. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational mathematics, vol. 9, no. 6, pp. 717–772, 2009.
  3. M. Fazel, “Matrix rank minimization with applications,” Ph.D. dissertation, PhD thesis, Stanford University, 2002.
  4. S. Sun, W. Bajwa, and A. Petropulu, “MIMO-MC radar: A MIMO radar approach based on matrix completion,” IEEE Transactions on Aerospace and Electronic Systems, vol. 51, no. 3, pp. 1839–1852, 2015.
  5. D. Kalogerias and A. Petropulu, “Matrix completion in colocated MIMO radar: Recoverability, bounds & theoretical guarantees,” IEEE Transactions on Signal Processing, vol. 62, no. 2, pp. 309–321, 2013.
  6. S. Sun and A. Petropulu, “Waveform design for MIMO radars with matrix completion,” IEEE Journal of Selected Topics in Signal Processing, vol. 9, no. 8, pp. 1400–1414, 2015.
  7. A. Mezghani and A. 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.
  8. C.-L. Liu and P. Vaidyanathan, “One-bit sparse array DoA estimation,” in IEEE International Conference on Acoustics, Speech and Signal Processing, 2017, pp. 3126–3130.
  9. L. Schuchman, “Dither signals and their effect on quantization noise,” IEEE Transactions on Communication Technology, vol. 12, no. 4, pp. 162–165, 1964.
  10. 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.
  11. F. Xi, Y. Xiang, S. Chen, and A. Nehorai, “Gridless parameter estimation for one-bit MIMO radar with time-varying thresholds,” IEEE Transactions on Signal Processing, vol. 68, pp. 1048–1063, 2020.
  12. I. Robinson, J. Toplicar, and J. Heston, “Analog to digital conversion using differential dither,” 2019, US Patent 10,298,256.
  13. A. Ali and P. Gulati, “Background calibration of reference, DAC, and quantization non-linearity in ADCs,” Jan. 28 2020, US Patent 10,547,319.
  14. A. Eamaz, F. Yeganegi, and M. Soltanalian, “Modified arcsine law for one-bit sampled stationary signals with time-varying thresholds,” in IEEE International Conference on Acoustics, Speech and Signal Processing, 2021, pp. 5459–5463.
  15. A. Eamaz,, F. Yeganegi, and M. Soltanalian , “Covariance recovery for one-bit sampled non-stationary signals with time-varying sampling thresholds,” IEEE Transactions on Signal Processing, 2022.
  16. A. Eamaz, F. Yeganegi, and M. Soltanalian, “Covariance recovery for one-bit sampled stationary signals with time-varying sampling thresholds,” Signal Processing, vol. 206, p. 108899, 2023.
  17. S. Dirksen, J. Maly, and H. Rauhut, “Covariance estimation under one-bit quantization,” The Annals of Statistics, vol. 50, no. 6, pp. 3538–3562, 2022.
  18. 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.
  19. 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.
  20. S. Dirksen and S. Mendelson, “Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing,” Journal of the European Mathematical Society, vol. 23, no. 9, pp. 2913–2947, 2021.
  21. A. Eamaz, F. Yeganegi, D. Needell, and M. Soltanalian, “Harnessing the power of sample abundance: Theoretical guarantees and algorithms for accelerated one-bit sensing,” arXiv preprint arXiv:2308.00695, 2023.
  22. A. Eamaz, F. Yeganegi, and M. Soltanalian, “One-bit phase retrieval: More samples means less complexity?” IEEE Transactions on Signal Processing, vol. 70, pp. 4618–4632, 2022.
  23. A. Eamaz, K. V. Mishra, F. Yeganegi, and M. Soltanalian, “UNO: Unlimited sampling meets one-bit quantization,” arXiv preprint arXiv:2301.10155, 2022.
  24. M. A. Davenport, Y. Plan, E. Van Den Berg, and M. Wootters, “1-bit matrix completion,” Information and Inference: A Journal of the IMA, vol. 3, no. 3, pp. 189–223, 2014.
  25. P. Martinsson and J. Tropp, “Randomized numerical linear algebra: Foundations and algorithms,” Acta Numerica, vol. 29, pp. 403–572, 2020.
  26. S. Bhaskar and A. Javanmard, “1-bit matrix completion under exact low-rank constraint,” in Annual Conference on Information Sciences and Systems, 2015, pp. 1–6.
  27. T. Cai and W. Zhou, “A max-norm constrained minimization approach to 1-bit matrix completion.” J. Mach. Learn. Res., vol. 14, no. 1, pp. 3619–3647, 2013.
  28. R. Ni and Q. Gu, “Optimal statistical and computational rates for one bit matrix completion,” in Artificial Intelligence and Statistics.   PMLR, 2016, pp. 426–434.
  29. S. Bhaskar, “Probabilistic low-rank matrix completion from quantized measurements,” The Journal of Machine Learning Research, vol. 17, no. 1, pp. 2131–2164, 2016.
  30. Y. Cao and Y. Xie, “Categorical matrix completion,” in 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP).   IEEE, 2015, pp. 369–372.
  31. P. Gao, R. Wang, M. Wang, and J. Chow, “Low-rank matrix recovery from noisy, quantized, and erroneous measurements,” IEEE Transactions on Signal Processing, vol. 66, no. 11, pp. 2918–2932, 2018.
  32. R. Baraniuk, S. Foucart, D. Needell, Y. Plan, and M. Wootters, “Exponential decay of reconstruction error from binary measurements of sparse signals,” IEEE Transactions on Information Theory, vol. 63, no. 6, pp. 3368–3385, 2017.
  33. A. Bose, A. Ameri, M. Klug, and M. Soltanalian, “Low-rank matrix recovery from one-bit comparison information,” in 2018 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP).   IEEE, 2018, pp. 4734–4738.
  34. S. Sun, K. V. Mishra, and A. Petropulu, “Target estimation by exploiting low rank structure in widely separated MIMO radar,” in 2019 IEEE Radar Conference (RadarConf).   IEEE, 2019, pp. 1–6.
  35. S. Ma, D. Goldfarb, and L. Chen, “Fixed point and bregman iterative methods for matrix rank minimization,” Mathematical Programming, vol. 128, no. 1-2, pp. 321–353, 2011.
  36. W. Yin, S. Osher, D. Goldfarb, and J. Darbon, “Bregman iterative algorithms for l1-minimization with applications to compressed sensing,” SIAM Journal on Imaging sciences, vol. 1, no. 1, pp. 143–168, 2008.
  37. M. Wagdy, “Effect of various dither forms on quantization errors of ideal A/D converters,” IEEE Transactions on Instrumentation and Measurement, vol. 38, no. 4, pp. 850–855, 1989.
  38. J. Cai, E. Candès, and Z. Shen, “A singular value thresholding algorithm for matrix completion,” SIAM Journal on optimization, vol. 20, no. 4, pp. 1956–1982, 2010.
  39. 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.
  40. B. Polyak, “Gradient methods for solving equations and inequalities,” USSR Computational Mathematics and Mathematical Physics, vol. 4, no. 6, pp. 17–32, 1964.
  41. 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.
  42. E. Candès and Y. Plan, “Matrix completion with noise,” Proceedings of the IEEE, vol. 98, no. 6, pp. 925–936, 2010.
  43. A. Eamaz, F. Yeganegi, D. Needell, and M. Soltanalian, “One-bit quadratic compressed sensing: From sample abundance to linear feasibility,” in 2023 IEEE International Symposium on Information Theory (ISIT), 2023, pp. 1154–1159.
  44. T. Oh, Y. Matsushita, Y. Tai, and I. Kweon, “Fast randomized singular value thresholding for low-rank optimization,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 40, no. 2, pp. 376–391, 2017.
  45. B. C. Eaves, “On the basic theorem of complementarity,” Mathematical Programming, vol. 1, no. 1, pp. 68–75, 1971.
  46. A. J. Hoffman, “On approximate solutions of systems of linear inequalities,” in Selected Papers Of Alan J Hoffman: With Commentary.   World Scientific, 2003, pp. 174–176.
  47. F. Andersson, M. Carlsson, and K. Perfekt, “Operator-Lipschitz estimates for the singular value functional calculus,” Proceedings of the American Mathematical Society, vol. 144, no. 5, pp. 1867–1875, 2016.
Citations (3)
View on Semantic Scholar

Summary

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

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

Tweets