Advertisement

Journal of Fourier Analysis and Applications

, Volume 25, Issue 1, pp 1–31 | Cite as

Painless Breakups—Efficient Demixing of Low Rank Matrices

  • Thomas Strohmer
  • Ke WeiEmail author
Article
First Online:

Abstract

Assume we are given a sum of linear measurements of s different rank-r matrices of the form \(\varvec{y}= \sum _{k=1}^{s} \mathcal {A}_k (\varvec{X}_k)\). When and under which conditions is it possible to extract (demix) the individual matrices \(\varvec{X}_k\) from the single measurement vector \(\varvec{y}\)? And can we do the demixing numerically efficiently? We present two computationally efficient algorithms based on hard thresholding to solve this low rank demixing problem. We introduce an Amalgam-Restricted Isometry Property which is especially suitable for demixing problems and prove that under appropriate conditions these algorithms are guaranteed to converge to the correct solution at a linear rate. We discuss applications in connection with quantum tomography and the Internet-of-Things. Numerical simulations demonstrate the empirical performance of the proposed algorithms.

Keywords

Demixing Low-rank matrices Random matrices Nonconvex optimization Iterative hard thresholding Quantum tomography Restricted isometry property Blind deconvolution 

Mathematics Subject Classification

15A29 15A52 41A29 65F22 90C26 93C41 
This is a preview of subscription content, log in to check access.

References

  1. 1.
    Absil, P.-A., Mahony, R., Sepulchre, R.: Optimization Algorithms on Matrix Manifolds. Princeton University Press, Princeton (2008)CrossRefzbMATHGoogle Scholar
  2. 2.
    Ahmed, A., Recht, B., Romberg, J.: Blind deconvolution using convex programming. IEEE Trans. Inf. Theory 60, 1711–1732 (2014)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bristow, H., Eriksson, A. and Lucey, S.: Fast convolutional sparse coding. ln: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 391–398 (2013)Google Scholar
  4. 4.
    Cai, J.-F., Candès, E.J., Shen, Z.: A singular value thresholding algorithm for matrix completion. SIAM J. Optim. 20, 1956–1982 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Campisi, P., Egiazarian, K.: Blind Image Deconvolution: Theory and Applications. CRC Press, Boca Raton (2007)CrossRefGoogle Scholar
  6. 6.
    Candès, E.J., Plan, Y.: Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements. IEEE Trans. Inf. Theory 57, 2342–2359 (2011)CrossRefzbMATHGoogle Scholar
  7. 7.
    Candès, E.J., Recht, B.: Exact matrix completion via convex optimization. Found. Comput. Math. 9, 717–772 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Candès, E.J., Li, X., Ma, Y., Wright, J.: Robust principal component analysis? J. ACM 58, 1–37 (2011)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Candès, E., Strohmer, T., Voroninski, V.: Phaselift: exact and stable signal recovery from magnitude measurements via convex programming. Commun. Pure Appl. Math. 66, 1241–1274 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Chen, Y., Ye, X.: Projection onto a simplex. Preprint (2011). arXiv:1101.6081
  11. 11.
    Deville, A., Deville, Y.: Concepts and criteria for blind quantum source separation. Preprint (2016). arXiv:1611.04002
  12. 12.
    Forsgren, A., Gill, P.E., Wright, M.H.: Interior methods for nonlinear optimization. SIAM Rev. 44, 525–597 (2002)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gross, D., Liu, Y.-K., Flammia, S. T., Becker, S., Eisert, J.: Quantum state tomography via compressed sensing. Phys. Rev. Lett (2010). doi: 10.1103/PhysRevLett.105.150401
  14. 14.
    Hedayat, A., Wallis, W.D.: Hadamard matrices and their applications. Ann. Stat. 6, 1184–1238 (1978)MathSciNetCrossRefzbMATHGoogle Scholar
  15. 15.
    Higham, N.J.: Computing a nearest symmetric positive semidefinite matrix. Linear Algebra Appl. 103, 103–118 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Huang, F., Anandkumar, A.: Convolutional dictionary learning through tensor factorization. Preprint (2015). arXiv:1506.03509
  17. 17.
    Kliesch, M., Kueng, R., Eisert, J., Gross, D.: Guaranteed recovery of quantum processes from few measurements. Preprint (2017). arXiv:1701.03135
  18. 18.
    Ling, S., Strohmer, T.: Blind deconvolution meets blind demixing: algorithms and performance bounds. IEEE Trans. Inf. Theory 63(7), 4497–4520 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Ling, S., Strohmer, T.: Regularized gradient descent: a nonconvex recipe for fast joint blind deconvolution and demixing. Preprint (2017). arXiv:1703.08642
  20. 20.
    Liu, J., Xin, J., Qi, Y., Zheng, F.-G., et al.: A time domain algorithm for blind separation of convolutive sound mixtures and \(L_1\) constrained minimization of cross correlations. Commun. Math. Sci. 7, 109–128 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  21. 21.
    McCoy, M.B., Cevher, V., Dinh, Q.T., Asaei, A., Baldassarre, L.: Convexity in source separation: models, geometry, and algorithms. Signal Process. Mag. IEEE 31, 87–95 (2014)CrossRefGoogle Scholar
  22. 22.
    McCoy, M.B., Tropp, J.A.: Achievable performance of convex demixing. Tech. rep., Caltech, 2017, Paper dated Feb. 2013. ACM Technical Report 2017-02Google Scholar
  23. 23.
    Recht, B., Fazel, M., Parrilo, P.A.: Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization. SIAM Rev. 52, 471–501 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Starck, J.-L., Elad, M., Donoho, D.L.: Image decomposition via the combination of sparse representations and a variational approach. IEEE Trans. Image Process. 14, 1570–1582 (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  25. 25.
    Stöger, D., Jung, P., Krahmer, F.: Blind deconvolution and compressed sensing. ln: Compressed Sensing Theory and its Applications to Radar, Sonar and Remote Sensing (CoSeRa), 4th International Workshop on IEEE, pp. 24–27 (2016)Google Scholar
  26. 26.
    Tanner, J., Wei, K.: Normalized iterative hard thresholding for matrix completion. SIAM J. Sci. Comput. 35, S104–S125 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  27. 27.
    Vandereycken, B.: Low rank matrix completion by Riemannian optimization. SIAM J. Optim. 23, 1214–1236 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  28. 28.
    Vershynin, R.: Compressed sensing: theory and applications. In: Eldar, Y .C., Kutyniok, G. (eds.) Introduction to the Non-asymptotic Analysis of Random M. Cambridge University Press, Cambridge (2012)Google Scholar
  29. 29.
    Wang, X., Poor, H.V.: Blind equalization and multiuser detection in dispersive CDMA channels. IEEE Trans. Commun. 46, 91–103 (1998)CrossRefGoogle Scholar
  30. 30.
    Wei, K., Cai, J.-F., Chan, T.F., Leung, S.: Guarantees of Riemannian optimization for low rank matrix completion (2015). arXiv:1603.06610
  31. 31.
    Wei, K., Cai, J.-F., Chan, T.F., Leung, S.: Guarantees of Riemannian optimization for low rank matrix recovery. SIAM J. Matrix Anal. Appl. 37, 1198–1222 (2016)MathSciNetCrossRefzbMATHGoogle Scholar
  32. 32.
    Wright, J., Ganesh, A., Min, K., Ma, Y.: Compressive principal component pursuit. Inf. Inference 2, 32–68 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  33. 33.
    Wunder, G., Boche, H., Strohmer, T., Jung, P.: Sparse signal processing concepts for efficient 5G system design. IEEE Access 3, 195–208 (2015)CrossRefGoogle Scholar
  34. 34.
    Zhou, X., Yang, C., Zhao, H., Yu, W.: Low-rank modeling and its applications in image analysis. ACM Computi. Surv. (CSUR) 47, 36 (2015)Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2017

Authors and Affiliations

  1. 1.Department of MathematicsUniversity of California at DavisDavisUSA

Personalised recommendations