{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T19:34:23Z","timestamp":1730230463912,"version":"3.28.0"},"reference-count":28,"publisher":"IEEE","license":[{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:00:00Z","timestamp":1556668800000},"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":[],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1109\/icassp.2019.8683685","type":"proceedings-article","created":{"date-parts":[[2019,4,17]],"date-time":"2019-04-17T20:01:56Z","timestamp":1555531316000},"page":"2922-2926","source":"Crossref","is-referenced-by-count":4,"title":["Latent Schatten TT Norm for Tensor Completion"],"prefix":"10.1109","author":[{"given":"Andong","family":"Wang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xulin","family":"Song","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiyin","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhihui","family":"Lai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/110837711"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2724549"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.607"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2850324"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2017.2672439"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462592"},{"key":"ref16","first-page":"3930","article-title":"On tensor train rank minimization: Statistical efficiency and scalable algorithm","author":"imaizumi","year":"2017","journal-title":"NIPS"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/090752286"},{"key":"ref18","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1137\/130905010","article-title":"Robust low-rank tensor recovery: Models and algorithms","volume":"35","author":"donald","year":"2014","journal-title":"SIAM Journal on Matrix Analysis and Applications"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1515\/9781400873173"},{"key":"ref28","first-page":"2825","article-title":"Multitask learning meets tensor factorization: task imputation via convex optimization","author":"wimalawarne","year":"2014","journal-title":"NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.11.012"},{"key":"ref27","first-page":"3150","article-title":"A universal primal-dual convex optimization framework","author":"yurtsever","year":"2015","journal-title":"NIPS"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref6","first-page":"1331","article-title":"Convex tensor decomposition via structured schatten norm regularization","author":"tomioka","year":"2013","journal-title":"NIPS"},{"key":"ref5","first-page":"972","article-title":"Statistical performance of convex tensor decomposition","author":"tomioka","year":"2011","journal-title":"NIPS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/BF02310791"},{"key":"ref7","article-title":"A dual framework for low-rank tensor completion","author":"nimishakavi","year":"2018","journal-title":"NIPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2392756"},{"key":"ref9","article-title":"Tensor ring decomposition","author":"zhao","year":"2016","journal-title":"Arxiv preprint arXiv"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"},{"key":"ref21","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"JMLR"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1162\/neco_a_01123"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2811396"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"}],"event":{"name":"ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2019,5,12]]},"location":"Brighton, United Kingdom","end":{"date-parts":[[2019,5,17]]}},"container-title":["ICASSP 2019 - 2019 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8671773\/8682151\/08683685.pdf?arnumber=8683685","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,15]],"date-time":"2022-07-15T03:08:04Z","timestamp":1657854484000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8683685\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5]]},"references-count":28,"URL":"https:\/\/doi.org\/10.1109\/icassp.2019.8683685","relation":{},"subject":[],"published":{"date-parts":[[2019,5]]}}}