{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T02:33:54Z","timestamp":1787452434580,"version":"build-2736575974"},"reference-count":67,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3504292","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T14:14:20Z","timestamp":1732284860000},"page":"5470-5483","source":"Crossref","is-referenced-by-count":9,"title":["Low-Tubal-Rank Tensor Recovery via Factorized Gradient Descent"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-7829-1797","authenticated-orcid":false,"given":"Zhiyu","family":"Liu","sequence":"first","affiliation":[{"name":"State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8039-6679","authenticated-orcid":false,"given":"Zhi","family":"Han","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3805-7654","authenticated-orcid":false,"given":"Yandong","family":"Tang","sequence":"additional","affiliation":[{"name":"State Key Laboratory of Robotics, Shenyang Institute of Automation, Chinese Academy of Sciences, Shenyang, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6540-946X","authenticated-orcid":false,"given":"Xi-Le","family":"Zhao","sequence":"additional","affiliation":[{"name":"University of Electronic Science and Technology of China, Chengdu, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4207-5273","authenticated-orcid":false,"given":"Yao","family":"Wang","sequence":"additional","affiliation":[{"name":"Center for Intelligent Decision-making and Machine Learning, School of Management, Xi’an Jiaotong University, Xi’an, P. R. China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2639466"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3164837"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3201330"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2017.2771212"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2016.2602099"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/nsr\/nwx069"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2579262"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3170789"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3204203"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2305840"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"issue":"1","key":"ref12","first-page":"84","article-title":"Foundations of the parafac procedure: Models and conditions for an \u201cexplanatory\u201d multimodal factor analysis","volume":"16","author":"Harshman","year":"1970","journal-title":"UCLA Work. Pap. Phonetics"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289464"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2010.09.020"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2019.2891760"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2018\/347"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3051650"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2020.112767"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2762595"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10096130"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.06.020"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2022.109169"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref24","article-title":"On the computational and statistical complexity of over-parameterized matrix sensing","author":"Zhuo","year":"2021"},{"key":"ref25","first-page":"23831","article-title":"Small random initialization is akin to spectral learning: Optimization and generalization guarantees for overparameterized low-rank matrix reconstruction","volume":"34","author":"St\u00f6ger","year":"2021","journal-title":"Adv. Neur. Inf. Process. Syst."},{"key":"ref26","first-page":"5985","article-title":"Preconditioned gradient descent for over-parameterized nonconvex matrix factorization","volume":"34","author":"Zhang","year":"2021","journal-title":"Adv. Neur. Inf. Process. Syst."},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00615"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-019-2717-4"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2021.3063527"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2018.2879185"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2018.12.012"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.cam.2019.112680"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01793-9"},{"key":"ref34","first-page":"1619","article-title":"Exact tensor completion with sum-of-squares","volume-title":"Conf. Learn. Theory","author":"Potechin","year":"2017"},{"key":"ref35","article-title":"Nonconvex low-rank tensor completion from noisy data","volume":"32","author":"Cai","year":"2019","journal-title":"Adv. Neur. Inf. Process. Syst."},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3205781"},{"key":"ref37","article-title":"Provable tensor factorization with missing data","volume":"27","author":"Jain","year":"2014","journal-title":"Adv. Neur. Inf. Process. Syst."},{"key":"ref38","first-page":"18905","article-title":"Tensor completion made practical","volume":"33","author":"Liu","year":"2020","journal-title":"Adv. Neur. Inf. Process. Syst."},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21748"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1561\/2200000079"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1986"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383734"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay019"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref45","first-page":"73","article-title":"Square deal: Lower bounds and improved relaxations for tensor recovery","volume-title":"Int. Conf. Mach. Learn.","author":"Mu","year":"2014"},{"issue":"2","key":"ref46","first-page":"339","article-title":"Provable models for robust low-rank tensor completion","volume":"11","author":"Huang","year":"2015","journal-title":"Pacific J. Optim."},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2841377"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1214\/20-AOS1942"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-018-09408-6"},{"key":"ref50","first-page":"1","article-title":"Generalized low-rank plus sparse tensor estimation by fast Riemannian optimization","author":"Cai","year":"2022","journal-title":"J. Amer. Stat. Assoc."},{"issue":"347","key":"ref51","first-page":"1","article-title":"Implicit regularization and entrywise convergence of Riemannian optimization for low tucker-rank tensor completion","volume":"24","author":"Wang","year":"2023","journal-title":"J. Mach. Learn. Res."},{"key":"ref52","article-title":"Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap, and their interplay","author":"Luo","year":"2022"},{"issue":"1","key":"ref53","first-page":"7312","article-title":"Scaling and scalability: Provable nonconvex low-rank tensor estimation from incomplete measurements","volume":"23","author":"Tong","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref55","article-title":"Tensor ring decomposition","author":"Zhao","year":"2016"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2022.3181471"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TGRS.2022.3179275"},{"key":"ref59","article-title":"Tensor completion via tensor train based low-rank quotient geometry under a preconditioned metric","author":"Cai","year":"2022"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-024-00559-7"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2017.419"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2020.2986773"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/s10589-020-00231-w"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.5555\/3045390.3045493"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1435"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3051425"},{"key":"ref67","article-title":"How over-parameterization slows down gradient descent in matrix sensing: The curses of symmetry and initialization","volume-title":"Proc. 12th Int. Conf. Learn. Representations","author":"Xiong","year":"2023"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/78\/10347386\/10765145.pdf?arnumber=10765145","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:06:53Z","timestamp":1769494013000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10765145\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":67,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3504292","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}