{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T01:19:11Z","timestamp":1778635151513,"version":"3.51.4"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T00:00:00Z","timestamp":1603670400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T00:00:00Z","timestamp":1603670400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1810314"],"award-info":[{"award-number":["ECCS-1810314"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Adv Comput Math"],"published-print":{"date-parts":[[2020,12]]},"DOI":"10.1007\/s10444-020-09816-9","type":"journal-article","created":{"date-parts":[[2020,10,26]],"date-time":"2020-10-26T13:03:02Z","timestamp":1603717382000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Fast randomized matrix and tensor interpolative decomposition using CountSketch"],"prefix":"10.1007","volume":"46","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4477-481X","authenticated-orcid":false,"given":"Osman Asif","family":"Malik","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1932-8159","authenticated-orcid":false,"given":"Stephen","family":"Becker","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,26]]},"reference":[{"issue":"1","key":"9816_CR1","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1137\/060673096","volume":"39","author":"N Ailon","year":"2009","unstructured":"Ailon, N., Chazelle, B.: The fast Johnson\u2013Lindenstrauss transform and approximate nearest neighbors. SIAM J. Comput. 39(1), 302\u2013322 (2009)","journal-title":"SIAM J. Comput."},{"key":"9816_CR2","volume-title":"Theoretical Numerical Analysis: a Functional Analysis Framework. Number 39 in Texts in Applied Mathematics","author":"K Atkinson","year":"2009","unstructured":"Atkinson, K., Han, W.: Theoretical Numerical Analysis: a Functional Analysis Framework. Number 39 in Texts in Applied Mathematics, 3rd edn. Springer, New York (2009). ISBN 978-1-4419-0457-7","edition":"3rd edn."},{"issue":"3","key":"9816_CR3","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1137\/090767911","volume":"32","author":"H Avron","year":"2010","unstructured":"Avron, H., Maymounkov, P., Toledo, S.: Blendenpik: supercharging LAPACK\u2019s least-squares solver. SIAM J. Sci. Comput. 32(3), 1217\u20131236 (2010)","journal-title":"SIAM J. Sci. Comput."},{"key":"9816_CR4","unstructured":"Avron, H., Nguyen, H.L., Woodruff, D.P.: Subspace embeddings for the polynomial kernel. In: Proceedings of the 27th International Conference on Neural Information Processing Systems, vol. 2, pp 2258\u20132266. MIT Press (2014)"},{"issue":"2","key":"9816_CR5","doi-asserted-by":"publisher","first-page":"876","DOI":"10.1137\/17M1112303","volume":"39","author":"C Battaglino","year":"2018","unstructured":"Battaglino, C., Ballard, G., Kolda, T.G.: A practical randomized CP tensor decomposition. SIAM Journal on Matrix Analysis and Applications 39 (2), 876\u2013901 (2018)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"16","key":"9816_CR6","doi-asserted-by":"publisher","first-page":"10246","DOI":"10.1073\/pnas.112329799","volume":"99","author":"G Beylkin","year":"2002","unstructured":"Beylkin, G., Mohlenkamp, M.J.: Numerical operator calculus in higher dimensions. Proc. Natl. Acad. Sci. 99(16), 10246\u201310251 (2002)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"6","key":"9816_CR7","doi-asserted-by":"publisher","first-page":"2133","DOI":"10.1137\/040604959","volume":"26","author":"G Beylkin","year":"2006","unstructured":"Beylkin, G., Mohlenkamp, M.J.: Algorithms for numerical analysis in high dimensions. SIAM J. Sci. Comput. 26(6), 2133\u20132159 (2006)","journal-title":"SIAM J. Sci. Comput."},{"issue":"C","key":"9816_CR8","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.jcp.2014.10.009","volume":"281","author":"DJ Biagioni","year":"2015","unstructured":"Biagioni, D.J., Beylkin, D., Beylkin, G.: Randomized interpolative decomposition of separated representations. J. Comput. Phys. 281(C), 116\u2013134 (2015). ISSN 0021-9991. https:\/\/doi.org\/10.1016\/j.jcp.2014.10.009","journal-title":"J. Comput. Phys."},{"key":"9816_CR9","unstructured":"Bien, J., Xu, Y., Mahoney, M.W.: CUR from a sparse optimization viewpoint. In: Advances in Neural Information Processing Systems, pp 217\u2013225 (2010)"},{"issue":"2","key":"9816_CR10","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1137\/12086755X","volume":"43","author":"C Boutsidis","year":"2014","unstructured":"Boutsidis, C., Drineas, P., Magdon-Ismail, M.: Near-optimal column-based matrix reconstruction. SIAM J. Comput. 43(2), 687\u2013717 (2014)","journal-title":"SIAM J. Comput."},{"key":"9816_CR11","doi-asserted-by":"crossref","unstructured":"Boutsidis, C., Mahoney, M.W., Drineas, P.: An improved approximation algorithm for the column subset selection problem. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 968\u2013977. SIAM (2009)","DOI":"10.1137\/1.9781611973068.105"},{"issue":"2","key":"9816_CR12","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1137\/140977898","volume":"46","author":"C Boutsidis","year":"2017","unstructured":"Boutsidis, C., Woodruff, D.P.: Optimal CUR matrix decompositions. SIAM J. Comput. 46(2), 543\u2013589 (2017)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9816_CR13","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1016\/j.laa.2010.03.020","volume":"433","author":"CF Caiafa","year":"2010","unstructured":"Caiafa, C.F., Cichocki, A.: Generalizing the column\u2013row matrix decomposition to multi-way arrays. Linear Algebra Appl. 433(3), 557\u2013573 (2010)","journal-title":"Linear Algebra Appl."},{"issue":"1","key":"9816_CR14","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00400-6","volume":"312","author":"M Charikar","year":"2004","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. Theoretical Computer Science 312(1), 3\u201315 (2004). ISSN 0304-3975. https:\/\/doi.org\/10.1016\/S0304-3975(03)00400-6","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"9816_CR15","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1137\/030602678","volume":"26","author":"H Cheng","year":"2005","unstructured":"Cheng, H., Gimbutas, Z., Martinsson, P.-G., Rokhlin, V.: On the compression of low rank matrices. SIAM Journal on Scientific Computing 26(4), 1389\u20131404 (2005). ISSN 1064-8275. https:\/\/doi.org\/10.1137\/030602678","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"6","key":"9816_CR16","doi-asserted-by":"publisher","first-page":"54:1","DOI":"10.1145\/3019134","volume":"63","author":"KL Clarkson","year":"2017","unstructured":"Clarkson, K.L., Woodruff, D.P.: Low-rank approximation and regression in input sparsity time. Journal of the ACM 63(6), 54:1\u201354:45 (2017). ISSN 0004-5411. https:\/\/doi.org\/10.1145\/3019134","journal-title":"Journal of the ACM"},{"key":"9816_CR17","doi-asserted-by":"crossref","unstructured":"da Costa, M.N., Lopes, R.R., Romano, J.M.T.: Randomized methods for higher-order subspace separation. In: 2016 24th European Signal Processing Conference (EUSIPCO), pp 215\u2013219. IEEE (2016)","DOI":"10.1109\/EUSIPCO.2016.7760241"},{"key":"9816_CR18","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Rademacher, L.: Efficient volume sampling for row\/column subset selection. In: 2010 IEEE 51st Annual Symposium on Foundations of Computer Science, pp 329\u2013338. IEEE (2010)","DOI":"10.1109\/FOCS.2010.38"},{"key":"9816_CR19","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Rademacher, L., Vempala, S., Wang, G.: Matrix approximation and projective clustering via volume sampling. In: Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithm. Society for Industrial and Applied Mathematics, pp 1117\u20131126 (2006)","DOI":"10.1145\/1109557.1109681"},{"key":"9816_CR20","doi-asserted-by":"crossref","unstructured":"Deshpande, A., Vempala, S.: Adaptive sampling and fast low-rank matrix approximation. In: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, pp 292\u2013303. Springer (2006)","DOI":"10.1007\/11830924_28"},{"key":"9816_CR21","unstructured":"Diao, H., Song, Z., Sun, W., Woodruff, D.: Sketching for Kronecker product regression and P-splines. In: Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, pp 1299\u20131308 (2018)"},{"key":"9816_CR22","unstructured":"Drineas, P., Kannan, R.: Pass efficient algorithms for approximating large matrices. In: Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp 223\u2013232. Society for Industrial and Applied Mathematics, Baltimore (2003)"},{"issue":"1","key":"9816_CR23","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539704442702","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas, P., Kannan, R., Mahoney, M.W.: Fast Monte Carlo algorithms for matrices III Computing a compressed approximate matrix decomposition. SIAM J. Comput. 36(1), 184\u2013206 (2006)","journal-title":"SIAM J. Comput."},{"issue":"2-3","key":"9816_CR24","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1016\/j.laa.2006.08.023","volume":"420","author":"P Drineas","year":"2007","unstructured":"Drineas, P., Mahoney, M.W.: A randomized algorithm for a tensor-based generalization of the singular value decomposition. Linear Algebra and its Applications 420(2-3), 553\u2013571 (2007)","journal-title":"Linear Algebra and its Applications"},{"issue":"2","key":"9816_CR25","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1137\/07070471X","volume":"30","author":"P Drineas","year":"2008","unstructured":"Drineas, P., Mahoney, M.W., Muthukrishnan, S.: Relative-error CUR matrix decompositions. SIAM Journal on Matrix Analysis and Applications 30 (2), 844\u2013881 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"9816_CR26","doi-asserted-by":"publisher","first-page":"1031","DOI":"10.13001\/1081-3810.1489","volume":"22","author":"S Friedland","year":"2011","unstructured":"Friedland, S., Mehrmann, V., Miedlar, A., Nkengla, M.: Fast low rank approximations of matrices and tensors. Electronic Journal of Linear Algebra 22, 1031\u20131048 (2011). ISSN 1081-3810. https:\/\/doi.org\/10.13001\/1081-3810.1489","journal-title":"Electronic Journal of Linear Algebra"},{"issue":"6","key":"9816_CR27","doi-asserted-by":"publisher","first-page":"1025","DOI":"10.1145\/1039488.1039494","volume":"51","author":"A Frieze","year":"2004","unstructured":"Frieze, A., Kannan, R., Vempala, S.: Fast Monte-Carlo algorithms for finding low-rank approximations. Journal of the ACM (JACM) 51(6), 1025\u20131041 (2004)","journal-title":"Journal of the ACM (JACM)"},{"key":"9816_CR28","doi-asserted-by":"crossref","DOI":"10.56021\/9781421407944","volume-title":"Matrix Computation","author":"GH Golub","year":"2013","unstructured":"Golub, G.H., Van Loan, C.F.: Matrix Computation, 4th edn. Johns Hopkins University Press, Baltimore (2013). ISBN 978-1-4214-0794-4","edition":"4th edn."},{"issue":"4","key":"9816_CR29","doi-asserted-by":"publisher","first-page":"515","DOI":"10.1007\/BF02358985","volume":"62","author":"SA Goreinov","year":"1997","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: Pseudo-skeleton approximations by matrices of maximal volume. Mathematical Notes 62(4), 515\u2013519 (1997)","journal-title":"Mathematical Notes"},{"issue":"1-3","key":"9816_CR30","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0024-3795(96)00301-1","volume":"261","author":"SA Goreinov","year":"1997","unstructured":"Goreinov, S.A., Tyrtyshnikov, E.E., Zamarashkin, N.L.: A theory of pseudoskeleton approximations. Linear Algebra Appl. 261(1-3), 1\u201321 (1997)","journal-title":"Linear Algebra Appl."},{"issue":"4","key":"9816_CR31","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1137\/0917055","volume":"17","author":"M Gu","year":"1996","unstructured":"Gu, M., Eisenstat, S.C.: Efficient algorithms for computing a strong rank-revealing QR factorization. SIAM Journal on Scientific Computing 17(4), 848\u2013869 (1996). ISSN 1064-8275. https:\/\/doi.org\/10.1137\/0917055","journal-title":"SIAM Journal on Scientific Computing"},{"key":"9816_CR32","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Sinop, A.K.: Optimal column-based low-rank matrix reconstruction. In: Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, pp 1207\u20131214. SIAM (2012)","DOI":"10.1137\/1.9781611973099.95"},{"issue":"2","key":"9816_CR33","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Halko","year":"2011","unstructured":"Halko, N., Martinsson, P.-G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"9816_CR34","unstructured":"Iwen, M.A., Needell, D., Rebrova, E., Zare, A.: Lower memory oblivious (tensor) subspace embeddings with fewer random bits. Modewise Methods for Least Squares. arXiv:1912.08294 (2019)"},{"key":"9816_CR35","doi-asserted-by":"crossref","unstructured":"Jin, R., Kolda, T.G., Ward, R.: Faster Johnson-Lindenstrauss transforms via Kronecker Products. arXiv:1909.04801 (2019)","DOI":"10.1093\/imaiai\/iaaa028"},{"issue":"3","key":"9816_CR36","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"TG Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Review 51(3), 455\u2013500 (2009). ISSN 0036-1445. https:\/\/doi.org\/10.1137\/07070111X","journal-title":"SIAM Review"},{"issue":"51","key":"9816_CR37","doi-asserted-by":"publisher","first-page":"20167","DOI":"10.1073\/pnas.0709640104","volume":"104","author":"E Liberty","year":"2007","unstructured":"Liberty, E., Woolfe, F., Martinsson, P.-G., Rokhlin, V., Tygert, M.: Randomized algorithms for the low-rank approximation of matrices. Proceedings of the National Academy of Sciences 104(51), 20167\u201320172 (2007). ISSN 0027-8424, 1091-6490. https:\/\/doi.org\/10.1073\/pnas.0709640104","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"3","key":"9816_CR38","doi-asserted-by":"publisher","first-page":"697","DOI":"10.1073\/pnas.0803205106","volume":"106","author":"MW Mahoney","year":"2009","unstructured":"Mahoney, M.W., Drineas, P.: CUR matrix decompositions for improved data analysis. Proc. Natl. Acad. Sci. 106(3), 697\u2013702 (2009)","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"3","key":"9816_CR39","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1137\/060665336","volume":"30","author":"MW Mahoney","year":"2008","unstructured":"Mahoney, M.W., Maggioni, M., Drineas, P.: Tensor-CUR decompositions for tensor-based data. SIAM Journal on Matrix Analysis and Applications 30(3), 957\u2013987 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"9816_CR40","unstructured":"Malik, O.A., Becker, S.: Low-rank Tucker decomposition of large tensors using TensorSketch. In: Advances in Neural Information Processing Systems, pp 10096\u201310106 (2018)"},{"key":"9816_CR41","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.laa.2020.05.004","volume":"602","author":"OA Malik","year":"2020","unstructured":"Malik, O.A., Becker, S.: Guarantees for the Kronecker fast Johnson\u2013Lindenstrauss transform using a coherence and sampling argument. Linear Algebra and its Applications 602, 120\u2013137 (2020). ISSN 0024-3795. https:\/\/doi.org\/10.1016\/j.laa.2020.05.004","journal-title":"Linear Algebra and its Applications"},{"issue":"1","key":"9816_CR42","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.acha.2010.02.003","volume":"30","author":"P-G Martinsson","year":"2011","unstructured":"Martinsson, P.-G., Rokhlin, V., Tygert, M.: A randomized algorithm for the decomposition of matrices. Applied and Computational Harmonic Analysis 30(1), 47\u201368 (2011). ISSN 1063-5203. https:\/\/doi.org\/10.1016\/j.acha.2010.02.003","journal-title":"Applied and Computational Harmonic Analysis"},{"issue":"3","key":"9816_CR43","doi-asserted-by":"publisher","first-page":"939","DOI":"10.1137\/060655894","volume":"30","author":"IV Oseledets","year":"2008","unstructured":"Oseledets, I.V., Savostianov, D.V., Tyrtyshnikov, E.E.: Tucker dimensionality reduction of three-dimensional arrays in linear time. SIAM Journal on Matrix Analysis and Applications 30(3), 939\u2013956 (2008)","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"issue":"3","key":"9816_CR44","doi-asserted-by":"publisher","first-page":"9:1","DOI":"10.1145\/2493252.2493254","volume":"5","author":"R Pagh","year":"2013","unstructured":"Pagh, R.: Compressed matrix multiplication. ACM Transactions on Computation Theory 5(3), 9:1\u20139:17 (2013). ISSN 1942-3454. https:\/\/doi.org\/10.1145\/2493252.2493254","journal-title":"ACM Transactions on Computation Theory"},{"key":"9816_CR45","doi-asserted-by":"publisher","unstructured":"Pham, N., Pagh, R.: Fast and scalable polynomial kernels via explicit feature maps. In: Proceedings of the 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201913. ISBN 978-1-4503-2174-7. https:\/\/doi.org\/10.1145\/2487575.2487591, pp 239\u2013247. ACM, New York (2013)","DOI":"10.1145\/2487575.2487591"},{"key":"9816_CR46","unstructured":"Rakhshan, B.T., Rabusseau, G.: Tensorized random projections. arXiv:2003.05101 (2020)"},{"issue":"C","key":"9816_CR47","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.jcp.2017.07.012","volume":"348","author":"MJ Reynolds","year":"2017","unstructured":"Reynolds, M.J., Beylkin, G., Doostan, A.: Optimization via separated representations and the canonical tensor decomposition. J. Comput. Phys. 348(C), 220\u2013230 (2017)","journal-title":"J. Comput. Phys."},{"issue":"5","key":"9816_CR48","doi-asserted-by":"publisher","first-page":"A2634","DOI":"10.1137\/15M1042802","volume":"38","author":"MJ Reynolds","year":"2016","unstructured":"Reynolds, M.J., Doostan, A., Beylkin, G.: Randomized alternating least squares for canonical tensor decompositions application to a PDE with random data. SIAM J. Sci. Comput. 38(5), A2634\u2013A2664 (2016)","journal-title":"SIAM J. Sci. Comput."},{"key":"9816_CR49","doi-asserted-by":"crossref","unstructured":"Smith, S., Huang, K., Sidiropoulos, N.D., Karypis, G.: Streaming tensor factorization for infinite data sources. In: Proceedings of the SIAM International Conference on Data Mining, p 2018. SIAM (2018)","DOI":"10.1137\/1.9781611975321.10"},{"key":"9816_CR50","unstructured":"Sun, Y., Guo, Y., Tropp, J.A., Udell, M.: Tensor random projection for low memory dimension reduction. In: NeurIPS Workshop on Relational Representation Learning (2018)"},{"issue":"4","key":"9816_CR51","doi-asserted-by":"publisher","first-page":"2629","DOI":"10.1137\/17M1159932","volume":"11","author":"DA Tarzanagh","year":"2018","unstructured":"Tarzanagh, D.A., Michailidis, G.: Fast randomized algorithms for t-product based tensor operations and decompositions with applications to imaging data. SIAM Journal on Imaging Sciences 11(4), 2629\u20132664 (2018)","journal-title":"SIAM Journal on Imaging Sciences"},{"key":"9816_CR52","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C.E.: Mach: fast randomized tensor decompositions. In: Proceedings of the 2010 SIAM International Conference on Data Mining, pp 689\u2013700. SIAM (2010)","DOI":"10.1137\/1.9781611972801.60"},{"key":"9816_CR53","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/s006070070031","volume":"64","author":"EE Tyrtyshnikov","year":"2000","unstructured":"Tyrtyshnikov, E.E.: Incomplete cross approximation in the Mosaic-Skeleton method. Computing 64, 367\u2013380 (2000)","journal-title":"Computing"},{"issue":"3","key":"9816_CR54","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/s10444-016-9494-8","volume":"43","author":"S Voronin","year":"2017","unstructured":"Voronin, S., Martinsson, P.-G.: Efficient algorithms for CUR and interpolative matrix decompositions. Adv. Comput. Math. 43(3), 495\u2013516 (2017)","journal-title":"Adv. Comput. Math."},{"issue":"1","key":"9816_CR55","first-page":"2729","volume":"14","author":"S Wang","year":"2013","unstructured":"Wang, S., Zhang, Z.: Improving CUR matrix decomposition and the nystr\u00f6m approximation via adaptive sampling. The Journal of Machine Learning Research 14(1), 2729\u20132769 (2013)","journal-title":"The Journal of Machine Learning Research"},{"key":"9816_CR56","unstructured":"Wang, Y., Tung, H.-Y., Smola, A.J., Anandkumar, A.: Fast and guaranteed tensor decomposition via sketching. In: Advances in Neural Information Processing Systems, pp 991\u2013999 (2015)"},{"issue":"3","key":"9816_CR57","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.acha.2007.12.002","volume":"25","author":"F Woolfe","year":"2008","unstructured":"Woolfe, F., Liberty, E., Rokhlin, V., Tygert, M.: A fast randomized algorithm for the approximation of matrices. Applied and Computational Harmonic Analysis 25(3), 335\u2013366 (2008). ISSN 1063-5203. https:\/\/doi.org\/10.1016\/j.acha.2007.12.002","journal-title":"Applied and Computational Harmonic Analysis"},{"key":"9816_CR58","doi-asserted-by":"crossref","unstructured":"Yang, B., Zamzam, A., Sidiropoulos, N.D.: ParaSketch: parallel tensor factorization via sketching. In: Proceedings of the 2018 SIAM International Conference on Data Mining, pp 396\u2013404. SIAM (2018)","DOI":"10.1137\/1.9781611975321.45"},{"key":"9816_CR59","doi-asserted-by":"publisher","first-page":"e2179","DOI":"10.1002\/nla.2179","volume":"25","author":"J Zhang","year":"2018","unstructured":"Zhang, J., Saibaba, A.K., Kilmer, M.E., Aeron, S.: A randomized tensor singular value decomposition based on the t-product. Numerical Linear Algebra with Applications 25, e2179 (2018)","journal-title":"Numerical Linear Algebra with Applications"}],"container-title":["Advances in Computational Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-020-09816-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10444-020-09816-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10444-020-09816-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,10]],"date-time":"2023-10-10T16:19:21Z","timestamp":1696954761000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10444-020-09816-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,26]]},"references-count":59,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["9816"],"URL":"https:\/\/doi.org\/10.1007\/s10444-020-09816-9","relation":{},"ISSN":["1019-7168","1572-9044"],"issn-type":[{"value":"1019-7168","type":"print"},{"value":"1572-9044","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,26]]},"assertion":[{"value":"9 September 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"30 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"76"}}