{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T22:49:36Z","timestamp":1767912576994,"version":"3.49.0"},"reference-count":155,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100003443","name":"Ministry of Education and Science of the Russian Federation","doi-asserted-by":"publisher","award":["075.10.2021.068"],"award-info":[{"award-number":["075.10.2021.068"]}],"id":[{"id":"10.13039\/501100003443","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Grant","award":["PICT 2017-3208"],"award-info":[{"award-number":["PICT 2017-3208"]}]},{"name":"Grant","award":["UBACYT 20020170100192BA"],"award-info":[{"award-number":["UBACYT 20020170100192BA"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3125069","type":"journal-article","created":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T21:28:51Z","timestamp":1635888531000},"page":"150809-150838","source":"Crossref","is-referenced-by-count":21,"title":["Cross Tensor Approximation Methods for Compression and Dimensionality Reduction"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-2614-0146","authenticated-orcid":false,"given":"Salman","family":"Ahmadi-Asl","sequence":"first","affiliation":[{"name":"CDISE, Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0001-5437-6095","authenticated-orcid":false,"given":"Cesar F.","family":"Caiafa","sequence":"additional","affiliation":[{"name":"Instituto Argentino de Radioastronomía—CCT La Plata, CONICET\/CIC-PBA\/UNLP, Villa Elisa, Argentina"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-8364-7226","authenticated-orcid":false,"given":"Andrzej","family":"Cichocki","sequence":"additional","affiliation":[{"name":"CDISE, Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-5509-7773","authenticated-orcid":false,"given":"Anh Huy","family":"Phan","sequence":"additional","affiliation":[{"name":"CDISE, Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia"}]},{"ORCID":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/orcid.org\/0000-0002-5056-9508","authenticated-orcid":false,"given":"Toshihisa","family":"Tanaka","sequence":"additional","affiliation":[{"name":"Department of Electrical and Electronic Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan"}]},{"given":"Ivan","family":"Oseledets","sequence":"additional","affiliation":[{"name":"CDISE, Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia"}]},{"given":"Jun","family":"Wang","sequence":"additional","affiliation":[{"name":"CDISE, Skolkovo Institute of Science and Technology (SKOLTECH), Moscow, Russia"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.105"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/1039488.1039494"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442696"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442684"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.3044130"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/j.jbi.2017.12.003"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.3389\/fams.2018.00065"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2018.2840980"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442702"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/SCIS-ISIS.2014.7044685"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2002-3-3-research0011"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/NICS51282.2020.9335842"},{"key":"ref20","author":"comon","year":"2010","journal-title":"Handbook of Blind Source Separation Independent Component Analysis and Applications"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1587\/nolta.1.37"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1002\/cem.908"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000067"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1561\/2200000059"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2011.08.010"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"ref100","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-009-9076-9"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref50","article-title":"Polilinear approximation of matrices and integral equations","author":"savostyanov","year":"2006"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s006070070031"},{"key":"ref154","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.22172"},{"key":"ref153","first-page":"278","article-title":"A randomized singular value decomposition algorithm for image processing applications","author":"drinea","year":"2001","journal-title":"Proc 8th Panhellenic Conf Informat"},{"key":"ref155","doi-asserted-by":"publisher","DOI":"10.1002\/mrm.21757"},{"key":"ref150","doi-asserted-by":"publisher","DOI":"10.1002\/cem.1223"},{"key":"ref152","article-title":"Columbia object image library (coil-100)","author":"nene","year":"1996"},{"key":"ref151","doi-asserted-by":"publisher","DOI":"10.1137\/040608830"},{"key":"ref146","article-title":"Tensorizing neural networks","author":"novikov","year":"2015","journal-title":"arXiv 1509 06569"},{"key":"ref147","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(90)90014-6"},{"key":"ref148","doi-asserted-by":"publisher","DOI":"10.1348\/000711000159132"},{"key":"ref149","doi-asserted-by":"publisher","DOI":"10.1348\/000711005X64817"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1137\/060655894"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/060665336"},{"key":"ref57","article-title":"Fast and accurate randomized algorithms for low-rank tensor decompositions","author":"ma","year":"2021","journal-title":"arXiv 2104 01101"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1088\/2632-2153\/abad87"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3058103"},{"key":"ref54","first-page":"123","article-title":"Randomized algorithms for matrices and data","volume":"3","author":"mahoney","year":"2011","journal-title":"Found Trends Mach Learn"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1137\/140978430"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2009.5400045"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/12086755X"},{"key":"ref4","first-page":"110","article-title":"The extension of factor analysis to three-dimensional matrices","author":"tucker","year":"1964","journal-title":"Contributions to Mathematical Psychology"},{"key":"ref3","first-page":"122","article-title":"Implications of factor analysis of three-way matrices for measurement of change","volume":"15","author":"tucker","year":"1963","journal-title":"Problems Measuring Change"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/S0895479896305696"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/070690730"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/070690729"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1090\/conm\/280\/4620"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/060661685"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1137\/16M1083803"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/PL00005410"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1142\/9789812836021_0015"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1137\/20M1356944"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2006.v002a012"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/11830924_28"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.95"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2010.38"},{"key":"ref127","article-title":"Matrix rank minimization with applications","author":"fazel","year":"2002"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1016\/j.sigpro.2018.09.039"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1145\/3291842.3291912"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2797094"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492917000058"},{"key":"ref72","first-page":"2729","article-title":"Improving CUR matrix decomposition and the Nyström approximation via adaptive sampling","volume":"14","author":"wang","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1145\/3278607"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1137\/140958529"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2021"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1137\/090766498"},{"key":"ref130","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2015.7299078"},{"key":"ref77","first-page":"304","article-title":"Sampling techniques for the Nyström method method","author":"kumar","year":"2009","journal-title":"Proc Artif Intell Statist"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1049\/iet-cvi.2018.5764"},{"key":"ref134","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2677440"},{"key":"ref78","first-page":"981","article-title":"Sampling methods for the Nyström method","volume":"13","author":"kumar","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref132","doi-asserted-by":"publisher","DOI":"10.23919\/APSIPA.2018.8659762"},{"key":"ref79","first-page":"721","article-title":"Global versus local methods in nonlinear dimensionality reduction","author":"silva","year":"2003","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1145\/3207677.3278070"},{"key":"ref135","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.567"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1109\/TCI.2020.3006718"},{"key":"ref137","article-title":"A fast implementation of singular value thresholding algorithm using recycling rank revealing randomized singular value decomposition","author":"li","year":"2017","journal-title":"arXiv 1704 05528"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2009.07.024"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1111\/1365-2478.12894"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1137\/17M1159932"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.03.020"},{"key":"ref63","article-title":"Mode-wise tensor decompositions: Multi-dimensional generalizations of CUR decompositions","author":"cai","year":"2021","journal-title":"arXiv 2103 11037"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1002\/nla.1845"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1108"},{"key":"ref65","author":"vervliet","year":"2016","journal-title":"Tensorlab user guide"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1137\/20M1388322"},{"key":"ref66","author":"kolda","year":"2012","journal-title":"MATLAB Tensor Toolbox"},{"key":"ref142","first-page":"189","article-title":"Fast robust tensor principal component analysis via fiber cur decomposition","author":"cai","year":"2021","journal-title":"Proc IEEE\/CVF Int Conf Comput Vis"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1016\/S0024-3795(96)00301-1"},{"key":"ref143","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-61616-8_5"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2019.08.006"},{"key":"ref144","article-title":"Speeding-up convolutional neural networks using fine-tuned CP-decomposition","author":"lebedev","year":"2014","journal-title":"arXiv 1412 6553"},{"key":"ref69","first-page":"19","article-title":"Spectral gap error bounds for improving CUR matrix decomposition and the Nyström method","volume":"38","author":"anderson","year":"2015","journal-title":"Proc Mach Learn Res (PMLR) Artif Intell Statist"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/sapm192761164"},{"key":"ref145","article-title":"Compression of deep convolutional neural networks for fast and low power mobile applications","author":"kim","year":"2015","journal-title":"arXiv 1511 06530"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/sapm19287139"},{"key":"ref109","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref95","first-page":"3475","article-title":"Fast approximation of matrix coherence and statistical leverage","volume":"13","author":"drineas","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref108","article-title":"A step in the right dimension: Tensor algebra and applications","author":"newman","year":"2019"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref107","article-title":"Stable tensor neural networks for rapid deep learning","author":"newman","year":"2018","journal-title":"arXiv 1811 06569"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-016-9494-8"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2385040"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1137\/0917055"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1137\/15M1048628"},{"key":"ref104","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.1489"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1007\/s002110050451"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1007\/s10444-020-09816-9"},{"key":"ref102","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcp.2014.10.009"},{"key":"ref111","article-title":"A new block Krylov subspace framework with applications to functions of matrices acting on multiple vectors","author":"lund","year":"2018"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2288"},{"key":"ref110","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1137\/110836067"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1515\/RJNAMM.2008.020"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1134\/S106456240803023X"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1137\/16M1089873"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-009-9094-9"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/090764189"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref13","article-title":"Tensor ring decomposition","author":"zhao","year":"2016","journal-title":"arXiv 1606 05535"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s00791-014-0218-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2770146"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref82","article-title":"Hybrid CUR-type decomposition of tensors in the tucker format","author":"begovic","year":"2020","journal-title":"arXiv 2002 01992"},{"key":"ref117","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2299"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.05.025"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2006.08.023"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2013.2297439"},{"key":"ref84","article-title":"Low-rank tucker approximation of a tensor from streaming data","author":"sun","year":"2019","journal-title":"arXiv 1904 10951"},{"key":"ref119","first-page":"1412","article-title":"CUR algorithm for partially observed matrices","author":"xu","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2690524"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1137\/17M1111590"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1007\/s42967-019-00055-4"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2019.12.035"},{"key":"ref116","doi-asserted-by":"publisher","DOI":"10.1137\/110841229"},{"key":"ref80","first-page":"682","article-title":"Using the Nyström method to speed up kernel machines","author":"williams","year":"2001","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref115","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-016-0607-z"},{"key":"ref120","article-title":"T-singular values and T-sketching for third order tensors","author":"qi","year":"2021","journal-title":"arXiv 2103 00976"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-008-9110-x"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1002\/nla.2179"},{"key":"ref122","first-page":"10117","article-title":"Low-rank Tucker decomposition of large tensors using tensorsketch","author":"malik","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1002\/widm.1201"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00025-4"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150436"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2007.12.002"},{"key":"ref88","article-title":"Accelerated dense random projections","author":"liberty","year":"2009"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/http\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09599673.pdf?arnumber=9599673","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,8]],"date-time":"2022-09-08T20:43:40Z","timestamp":1662669820000},"score":1,"resource":{"primary":{"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/ieeexplore.ieee.org\/document\/9599673\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":155,"URL":"https:\/\/summer-heart-0930.chufeiyun1688.workers.dev:443\/https\/doi.org\/10.1109\/access.2021.3125069","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}