{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T16:39:07Z","timestamp":1778258347027,"version":"3.51.4"},"reference-count":60,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"8","license":[{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,8,1]],"date-time":"2023-08-01T00:00:00Z","timestamp":1690848000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"AMS Simons Travel","award":["NSF DMS 2011140"],"award-info":[{"award-number":["NSF DMS 2011140"]}]},{"name":"AMS Simons Travel","award":["NSF DMS 2108479"],"award-info":[{"award-number":["NSF DMS 2108479"]}]},{"name":"AMS Simons Travel","award":["NSF DMS 2304489"],"award-info":[{"award-number":["NSF DMS 2304489"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2023,8]]},"DOI":"10.1109\/tpami.2023.3261185","type":"journal-article","created":{"date-parts":[[2023,3,23]],"date-time":"2023-03-23T17:46:49Z","timestamp":1679593609000},"page":"10100-10113","source":"Crossref","is-referenced-by-count":19,"title":["Matrix Completion With Cross-Concentrated Sampling: Bridging Uniform Sampling and CUR Sampling"],"prefix":"10.1109","volume":"45","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2937-1986","authenticated-orcid":false,"given":"HanQin","family":"Cai","sequence":"first","affiliation":[{"name":"Department of Statistics and Data Science and Department of Computer Science, University of Central Florida, Orlando, FL, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6610-9653","authenticated-orcid":false,"given":"Longxiu","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Computational Mathematics, Science and Engineering and Department of Mathematics, Michigan State University, East Lansing, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-1890-1237","authenticated-orcid":false,"given":"Pengyu","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, MI, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8058-8638","authenticated-orcid":false,"given":"Deanna","family":"Needell","sequence":"additional","affiliation":[{"name":"Department of Mathematics, University of California, Los Angeles, Los Angeles, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1038\/nature06830"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.116033"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref59","first-page":"1","article-title":"Mode-wise tensor decompositions: Multi-dimensional generalizations of CUR decompositions","volume":"22","author":"cai","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.3150\/12-BEJ486"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/117\/38002"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011419012209"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/172879"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2598574"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-009-0306-5"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454031"},{"key":"ref46","article-title":"Compressed sensing, sparse approximation, and low-rank matrix estimation","author":"plan","year":"2011"},{"key":"ref45","first-page":"152","article-title":"Riemannian CUR decompositions for robust principal component analysis","author":"hamm","year":"2022","journal-title":"Proc Topological Algebr Geometric Learn Workshop"},{"key":"ref48","first-page":"2619","article-title":"A novel Bayesian similarity measure for recommender systems","author":"guo","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2827872"},{"key":"ref42","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":"ref41","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0803205106"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/19M128394X"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973068.106"},{"key":"ref49","article-title":"Matrix completion on graphs","author":"kalofolias","year":"2014"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1101\/gr.145821.112"},{"key":"ref7","article-title":"Structured gradient descent for fast robust low-rank Hankel matrix completion","author":"cai","year":"2022"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2015.1021005"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.52"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2017.04.004"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.271"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.3934\/fods.2020006"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1137\/120867287"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.3934\/ipi.2020011"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.64"},{"key":"ref36","first-page":"2539","article-title":"Greedy column subset selection: New bounds and distributed algorithms","author":"bhaskara","year":"2016","journal-title":"Proc 33rd Int Conf Mach Learn"},{"key":"ref31","article-title":"Convergence analysis for rectangular matrix completion using Burer-Monteiro factorization and gradient descent","author":"zheng","year":"2016"},{"key":"ref30","author":"keshavan","year":"2012","journal-title":"Efficient Algorithms for Collaborative Filtering"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1137\/110845768"},{"key":"ref32","first-page":"1","article-title":"Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent","volume":"22","author":"tong","year":"2021","journal-title":"J Mach Learn Res"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/1345448.1345459"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/07070471X"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539704442702"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/20M1388322"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2020.3044130"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref25","first-page":"1412","article-title":"CUR algorithm for partially observed matrices","author":"xu","year":"2015","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/BF02358985","article-title":"Pseudo-skeleton approximations by matrices of maximal volume","volume":"62","author":"zamarashkin","year":"1997","journal-title":"Math Notes"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2019.08.006"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/110852310"},{"key":"ref28","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"2010","journal-title":"Proc Int Conf Neural Inf Process"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"ref29","first-page":"1007","article-title":"Fast exact matrix completion with finite samples","author":"jain","year":"2015","journal-title":"Proc Conf Learn Theory"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW54120.2021.00026"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/10169863\/10079176.pdf?arnumber=10079176","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T17:33:06Z","timestamp":1720459986000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10079176\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8]]},"references-count":60,"journal-issue":{"issue":"8"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2023.3261185","relation":{},"ISSN":["0162-8828","2160-9292","1939-3539"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"},{"value":"1939-3539","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,8]]}}}