{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,29]],"date-time":"2026-06-29T22:14:18Z","timestamp":1782771258790,"version":"3.54.5"},"reference-count":77,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,8,1]],"date-time":"2024-08-01T00:00:00Z","timestamp":1722470400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61976161"],"award-info":[{"award-number":["61976161"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62225113"],"award-info":[{"award-number":["62225113"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Cybern."],"published-print":{"date-parts":[[2024,8]]},"DOI":"10.1109\/tcyb.2023.3305552","type":"journal-article","created":{"date-parts":[[2023,9,14]],"date-time":"2023-09-14T17:56:48Z","timestamp":1694714208000},"page":"4443-4453","source":"Crossref","is-referenced-by-count":5,"title":["Leveraged Matrix Completion With Noise"],"prefix":"10.1109","volume":"54","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8956-7326","authenticated-orcid":false,"given":"Xinjian","family":"Huang","sequence":"first","affiliation":[{"name":"School of Cyber Science and Engineering, Nanjing University of Science and Technology, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2450-3369","authenticated-orcid":false,"given":"Weiwei","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer Science, National Engineering Research Center for Multimedia Software, Institute of Artificial Intelligence, and the Hubei Key Laboratory of Multimedia and Network Communication Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0059-8458","authenticated-orcid":false,"given":"Bo","family":"Du","sequence":"additional","affiliation":[{"name":"School of Computer Science, National Engineering Research Center for Multimedia Software, Institute of Artificial Intelligence, and the Hubei Key Laboratory of Multimedia and Network Communication Engineering, Wuhan University, Wuhan, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[{"name":"School of Computer Science, Faculty of Engineering, The University of Sydney, Darlington, NSW, Australia"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2021.3072896"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2022.3224070"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2904021"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/tcyb.2022.3198932"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3039308"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2022.3157083"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2023.3236415"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3250325"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2018.2853589"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2018.2815559"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v30i1.9967"},{"key":"ref13","first-page":"6724","article-title":"Adaptive adversarial multi-task representation learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Mao"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/2020.acl-main.388"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TCYB.2015.2457611"},{"key":"ref16","first-page":"981","article-title":"A unified computational and statistical framework for nonconvex low-rank matrix estimation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Wang"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TCBB.2021.3088614"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TITS.2023.3247961"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313736"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2228881"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TMI.2021.3107829"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2018.2855433"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2014.2329451"},{"key":"ref26","first-page":"873","article-title":"Robust matrix completion and corrupted columns","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503144"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2016.2544758"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1080\/00031305.1978.10479237"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1561\/2200000035"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"issue":"104","key":"ref32","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"Recht","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1561\/2200000048"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"issue":"94","key":"ref36","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"Chen","year":"2015","journal-title":"J. Mach. Learn. Res."},{"key":"ref37","first-page":"836","article-title":"Low-rank matrix and tensor completion via adaptive sampling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"26","author":"Krishnamurthy"},{"key":"ref38","first-page":"2955","article-title":"Noise-tolerant life-long matrix completion via adaptive sampling","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"29","author":"Balcan"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2992769"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref41","volume-title":"The augmented lagrange multiplier method for exact recovery of corrupted low-rank matrices","author":"Lin","year":"2013"},{"key":"ref42","first-page":"612","article-title":"Linearized alternating direction method with adaptive penalty for low rank representation","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lin"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-016-0930-5"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.366"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2465956"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v26i1.8210"},{"key":"ref48","first-page":"5105","article-title":"Factor group-sparse regularization for efficient low-rank matrix recovery","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Fan"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIP.2016.2599290"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2020.2978465"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2020\/89"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2020.01.103"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/LGRS.2019.2896888"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2019.00606"},{"key":"ref55","first-page":"1329","article-title":"Maximum-margin matrix factorization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Srebro"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-012-0044-1"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2015.02.026"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2017.2748590"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/TCSVT.2022.3214583"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2021.3106155"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2017.10.014"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.00889"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2952057"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1007\/s40305-020-00295-9"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1016\/j.neunet.2017.10.007"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3215974"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/tkde.2023.3253791"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/tnnls.2022.3183970"},{"key":"ref70","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1137\/140988541"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iax020"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1137\/090761793"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref76","first-page":"720","article-title":"Weighted low-rank approximations","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Srebro"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1742"}],"container-title":["IEEE Transactions on Cybernetics"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6221036\/10604457\/10251395.pdf?arnumber=10251395","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:33:20Z","timestamp":1725561200000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10251395\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8]]},"references-count":77,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tcyb.2023.3305552","relation":{},"ISSN":["2168-2267","2168-2275"],"issn-type":[{"value":"2168-2267","type":"print"},{"value":"2168-2275","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8]]}}}