{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T17:35:55Z","timestamp":1761759355244,"version":"build-2065373602"},"reference-count":50,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"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":["12422111","12371273"],"award-info":[{"award-number":["12422111","12371273"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100013105","name":"Shanghai Rising-Star Program","doi-asserted-by":"publisher","award":["23QA1404600"],"award-info":[{"award-number":["23QA1404600"]}],"id":[{"id":"10.13039\/501100013105","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Young Elite Scientists Sponsorship Program by CAST","award":["2023QNRC001"],"award-info":[{"award-number":["2023QNRC001"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12401339"],"award-info":[{"award-number":["12401339"]}],"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":["12571291"],"award-info":[{"award-number":["12571291"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Humanities and Social Sciences Foundation of the Ministry of Education of China","award":["23YJA910005"],"award-info":[{"award-number":["23YJA910005"]}]},{"name":"Fujian Provincial Natural Science Foundation of China","award":["2025J01037"],"award-info":[{"award-number":["2025J01037"]}]},{"DOI":"10.13039\/501100001809","name":"Open Research Fund of Key Laboratory of Analytical Mathematics and Applications","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1109\/tit.2025.3610522","type":"journal-article","created":{"date-parts":[[2025,9,16]],"date-time":"2025-09-16T17:33:31Z","timestamp":1758044011000},"page":"8673-8696","source":"Crossref","is-referenced-by-count":0,"title":["Group-Sparse Inductive Matrix Completion Through Transfer Learning"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9362-508X","authenticated-orcid":false,"given":"Xiaojun","family":"Mao","sequence":"first","affiliation":[{"name":"School of Mathematical Sciences, Shanghai Jiao Tong University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0472-2073","authenticated-orcid":false,"given":"Hengfang","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Mathematics and Statistics and Fujian Provincial Key Laboratory of Statistics and Artificial Intelligence, Fujian Normal University, Fuzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6712-0750","authenticated-orcid":false,"given":"Zhonglei","family":"Wang","sequence":"additional","affiliation":[{"name":"Wang Yanan Institute for Studies in Economics and the School of Economics, Xiamen University, Xiamen, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1877","article-title":"Language models are few-shot learners","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Brown"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"issue":"53","key":"ref5","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"Negahban","year":"2010","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"ref6","first-page":"3619","article-title":"A max-norm constrained minimization approach to 1-bit matrix completion","volume":"14","author":"Cai","year":"2013","journal-title":"J. Mach. Learn. Res."},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2015.1021005"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/rssb.12400"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3039308"},{"key":"ref11","first-page":"757","article-title":"Transduction with matrix completion: Three birds with one stone","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"23","author":"Goldberg"},{"key":"ref12","article-title":"Provable inductive matrix completion","author":"Jain","year":"2013","journal-title":"arXiv:1306.0626"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2014.999158"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2017.1389740"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2019.1623041"},{"issue":"180","key":"ref16","first-page":"1","article-title":"Matrix completion with covariate information and informative missingness","volume":"23","author":"Jin","year":"2022","journal-title":"J. Mach. Learn. Res."},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2024.2335591"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2022.2141752"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1214\/23-AOAS1747"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/24-AOS2362"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2013.01.003"},{"key":"ref22","first-page":"1","article-title":"Inductive matrix completion based on graph neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33018602"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1214\/11-aos896"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btu269"},{"key":"ref26","first-page":"3447","article-title":"Matrix completion with noisy side information","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"28","author":"Chiang"},{"key":"ref27","first-page":"2973","article-title":"Matrix completion has no spurious local minimum","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Ge"},{"key":"ref28","first-page":"1233","article-title":"No spurious local minima in nonconvex low rank problems: A unified geometric analysis","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Ge"},{"key":"ref29","first-page":"5756","article-title":"Fast and sample efficient inductive matrix completion via multi-phase Procrustes flow","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iay003"},{"key":"ref31","first-page":"27671","article-title":"Inductive matrix completion: No bad local minima and a fast algorithm","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Zilber"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2023.2184373"},{"key":"ref33","first-page":"6009","article-title":"Head2Toe: Utilizing intermediate representations for better transfer learning","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Evci"},{"key":"ref34","first-page":"12991","article-title":"LST: Ladder side-tuning for parameter and memory efficient transfer learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Sung"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2139\/ssrn.4730050"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/21M1433812"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401969"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1561\/9781601984616"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/1273496.1273567"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1080\/10618600.2012.681250"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462250"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.5555\/2789272.2789291"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1016\/j.atmosenv.2018.08.047"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref45","article-title":"A gradient descent algorithm on the Grassman manifold for matrix completion","author":"Keshavan","year":"2009","journal-title":"arXiv:0910.5260"},{"key":"ref46","first-page":"10","article-title":"Rank selection in low-rank matrix approximations: A study of cross-validation for NMFs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"1","author":"Kanagal"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1521171113"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1002\/sim.9934"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1145\/355984.355989"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v17-2079"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/11220181\/11165391.pdf?arnumber=11165391","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T17:33:18Z","timestamp":1761759198000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11165391\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":50,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3610522","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2025,11]]}}}