Abstract
The manuscript describes efficient algorithms for the computation of the CUR and ID decompositions. The methods used are based on simple modifications to the classical truncated pivoted QR decomposition, which means that highly optimized library codes can be utilized for implementation. For certain applications, further acceleration can be attained by incorporating techniques based on randomized projections. Numerical experiments demonstrate advantageous performance compared to existing techniques for computing CUR factorizations.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, E., Bai, Z., Bischof, C., Blackford, S., Demmel, J., Dongarra, J., Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., Sorensen, D.: LAPACK Users’ Guide, 3rd edn. Society for Industrial and Applied Mathematics, Philadelphia, PA (1999)
Bodor, A., Csabai, I., Mahoney, M., Solymosi, N.: rCUR: an R package for CUR matrix decomposition. BMC Bioinformatics, 13(1) (2012)
Boutsidis, C., Woodruff, D.P.: Optimal cur matrix decompositions. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp 353–362 (2014)
Chan, T.F.: Rank revealing QR factorizations. Linear Algebra Appl. 88/89, 67–82 (1987)
Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Relative-error CUR Matrix decompositions. SIAM J. Matrix Anal. Appl. 30(2), 844–881 (2008)
Eckart, C., Young, G.: The approximation of one matrix by another of lower rank. Psychometrika 1(3), 211–218 (1936)
Golub, G.H., Van Loan, C.F.: Matrix Computations. Johns Hopkins Studies in the Mathematical Sciences, 4th edn. Johns Hopkins University Press, Baltimore (2013)
Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudoskeleton approximations. Linear Algebra Appl. 261(1), 1–21 (1997)
Ming, G., Eisenstat, S.C.: Efficient algorithms for computing a strong rank-revealing qr factorization. SIAM J. Sci Comput. 17(4), 848–869 (1996)
Halko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217–288 (2011)
Hoaglin, D.C., Welsch, R.E.: The Hat matrix in regression and ANOVA. Am. Stat. 32(1), 17–22 (1978)
Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., Tygert, M.: Randomized algorithms for the low-rank approximation of matrices. Proc. Natl. Acad. Sci. 104(51), 20167–20172 (2007)
Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. USA 106(3), 697–702 (2009). With supplementary material available online
Martinsson, P.-G., Rokhlin, V., Tygert, M.: A Randomized Algorithm for the Approximation of Matrices. Technical Report Yale CS Research Report YALEU/DCS/RR-1361, Yale University, Computer Science Department (2006)
Mitrovic, N., Asif, M.T., Rasheed, U., Dauwels, J., Jaillet, P.: CUR decomposition for compression and compressed sensing of large-scale traffic data Proceedings of the 16th International IEEE Annual Conference on Intelligent Transportation Systems (2013)
Rokhlin, V., Szlam, A., Tygert, M.: A randomized algorithm for principal component analysis. SIAM J. Matrix Anal. Appl. 31(3), 1100–1124 (2009)
Sarlos, T.: Improved approximation algorithms for large matrices via random projections. In: 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS’06), pp 143–152 (2006)
Sorensen, D.C., Embree, M.: A DEIM Induced CUR Factorization ArXiv e-prints (2014)
Tyrtyshnikov, E.: Incomplete cross approximation in the mosaic-skeleton method. Computing 64(4), 367–380 (2000)
Voronin, S., Martinsson, P.-G.: Rsvdpack: Subroutines for computing partial singular value decompositions via randomized sampling on single core, multi core, and gpu architectures. arXiv:1502.05366 (2015)
Wang, S., Zhang, Z.: Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling. J. Mach. Learn Res. 14, 2729–2769 (2013)
Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Appl. Comput. Harmon. Anal. 25(3), 335–366 (2008)
Author information
Authors and Affiliations
Corresponding author
Additional information
Communicated by: Zydrunas Gimbutas
Rights and permissions
About this article
Cite this article
Voronin, S., Martinsson, PG. Efficient algorithms for cur and interpolative matrix decompositions. Adv Comput Math 43, 495–516 (2017). https://doi.org/10.1007/s10444-016-9494-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10444-016-9494-8