{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:40:10Z","timestamp":1773376810918,"version":"3.50.1"},"reference-count":26,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"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":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206880","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"2625-2630","source":"Crossref","is-referenced-by-count":0,"title":["Entry-Specific Bounds for Low-Rank Matrix Completion under Highly Non-Uniform Sampling"],"prefix":"10.1109","author":[{"given":"Xumei","family":"Xi","sequence":"first","affiliation":[{"name":"Cornell University,School of Operations Research and Information Engineering,Ithaca,NY,USA"}]},{"given":"Christina Lee","family":"Yu","sequence":"additional","affiliation":[{"name":"Cornell University,School of Operations Research and Information Engineering,Ithaca,NY,USA"}]},{"given":"Yudong","family":"Chen","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Department of Computer Sciences,Madison,WI,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/19-AOS1854"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/9781316882177.009"},{"key":"ref3","first-page":"1881","article-title":"Universal matrix completion","volume-title":"International Conference on Machine Learning","author":"Bhojanapalli"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2184319.2184343"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3019569"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2821706"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/19M1290000"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3039308"},{"key":"ref14","first-page":"703","article-title":"Computational limits for matrix completion","volume-title":"Conference on Learning Theory","author":"Hardt"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20483"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref17","article-title":"Matrix completion from noisy entries","volume":"22","author":"Keshavan","year":"2009","journal-title":"Advances in neural information processing systems"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref20","article-title":"Matrix completion from any given set of observations","volume-title":"Advances in Neural Information Processing Systems","volume":"26","author":"Lee","year":"2013"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1090\/coll\/060"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000048"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1017\/9781108231596"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/9781108627771"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206880.pdf?arnumber=10206880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:28:29Z","timestamp":1773347309000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206880\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":26,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206880","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}