{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T06:19:09Z","timestamp":1761718749231,"version":"3.37.3"},"reference-count":53,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery","doi-asserted-by":"publisher","award":["22R82411"],"award-info":[{"award-number":["22R82411"]}],"id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSERC Accelerator Award","award":["22R68054"],"award-info":[{"award-number":["22R68054"]}]},{"name":"NSERC Collaborative Research and Development Grant DNOISE II","award":["22R07504"],"award-info":[{"award-number":["22R07504"]}]},{"name":"NSERC Discovery Grant","award":["22R23068"],"award-info":[{"award-number":["22R23068"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2019,1,1]]},"DOI":"10.1109\/tsp.2018.2879031","type":"journal-article","created":{"date-parts":[[2018,11,6]],"date-time":"2018-11-06T01:37:45Z","timestamp":1541468265000},"page":"29-40","source":"Crossref","is-referenced-by-count":25,"title":["Learning Tensors From Partial Binary Measurements"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0399-5974","authenticated-orcid":false,"given":"Navid","family":"Ghadermarzy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yaniv","family":"Plan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ozgur","family":"Yilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2018.8462164"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.485"},{"key":"ref33","article-title":"Optimal\n feature selection for context-aware recommendation using differential relaxation","author":"zheng","year":"0","journal-title":"ACM RecSys' 12 Proc 4th Int Workshop Context-Aware Recommender Syst (CARS 2012)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33486-3_5"},{"key":"ref31","first-page":"545","article-title":"Rank, trace-norm and max-norm","author":"shraibman","year":"0","journal-title":"Proc Int Conf Comput Learn Theory"},{"key":"ref30","first-page":"1329","article-title":"Maximum-margin matrix factorization","author":"rennie","year":"0","journal-title":"Proc 17th Int Conf Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.201310004"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/s10543-013-0455-z"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.39"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/27\/2\/025010"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2015.7086879"},{"key":"ref27","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":"ref29","first-page":"426","article-title":"Optimal statistical and computational rates for one bit matrix completion","author":"ni","year":"0","journal-title":"Proc 19th Int Conf Artif Intell"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/ICIP.2010.5651225"},{"key":"ref22","first-page":"73","article-title":"Square deal: Lower bounds and improved\n relaxations for tensor recovery","author":"mu","year":"0","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85820-3_7"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864727"},{"key":"ref23","article-title":"Near-optimal sample complexity for convex tensor completion","author":"ghadermarzy","year":"2017","journal-title":"arXiv 1711 04965"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1137\/07070111X"},{"article-title":"British social attitudes 1983-1986 panel survey","year":"1986","author":"mcgrath","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23014-1_8"},{"key":"ref53","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-05170-3_49"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref11","first-page":"315","article-title":"Concentration-based guarantees for low-rank matrix reconstruction","author":"foygel","year":"0","journal-title":"Proc 24th Annu Conf Learn Theory"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2017.02.028"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1214\/16-EJS1147"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/10.2119"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2001.990454"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/11427995_21"},{"key":"ref17","article-title":"A new low-rank tensor model for video completion","author":"hu","year":"2015","journal-title":"arXiv 1509 02027"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1190\/geo2013-0022.1"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2015.04.015"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/130919210"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5205567"},{"key":"ref49","first-page":"456","article-title":"Optimizing costly\n functions with simple constraints: A limited-memory projected quasi-Newton algorithm","volume":"5","author":"schmidt","year":"0","journal-title":"Proc 12th Int Conf Artif Intell Statist"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref46","first-page":"2057","article-title":"Matrix\n completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511569166"},{"key":"ref48","article-title":"Optimistic\n rates for learning with a smooth loss","author":"srebro","year":"2010","journal-title":"arXiv 1009 3896"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1272"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.2352\/ISSN.2470-1173.2018.13.IPAS-261"},{"key":"ref41","article-title":"Spectral algorithms for tensor completion","author":"montanari","year":"2016","journal-title":"arXiv 1612 07866"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1112\/jlms\/s2-18.3.519"},{"key":"ref43","first-page":"2056","article-title":"Collaborative filtering in a non-uniform\n world: Learning with the weighted trace norm","author":"salakhutdinov","year":"0","journal-title":"Proc 23rd Int Conf Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8541135\/08519315.pdf?arnumber=8519315","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:42:40Z","timestamp":1657744960000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8519315\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,1]]},"references-count":53,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tsp.2018.2879031","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2019,1,1]]}}}