{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:54:31Z","timestamp":1774958071583,"version":"3.50.1"},"reference-count":141,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2016,6,1]],"date-time":"2016-06-01T00:00:00Z","timestamp":1464739200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NRL","award":["N00173-14-2-C001"],"award-info":[{"award-number":["N00173-14-2-C001"]}]},{"DOI":"10.13039\/100000181","name":"AFOSR","doi-asserted-by":"publisher","award":["FA9550-14-1-0342"],"award-info":[{"award-number":["FA9550-14-1-0342"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1409406"],"award-info":[{"award-number":["CCF-1409406"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1350616"],"award-info":[{"award-number":["CCF-1350616"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CMMI-1537261"],"award-info":[{"award-number":["CMMI-1537261"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"ONR","doi-asserted-by":"publisher","award":["N00014-11-1-0459"],"award-info":[{"award-number":["N00014-11-1-0459"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CCF-1422540"],"award-info":[{"award-number":["CCF-1422540"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000008","name":"Packard Foundation","doi-asserted-by":"crossref","id":[{"id":"10.13039\/100000008","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1109\/jstsp.2016.2539100","type":"journal-article","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T19:10:15Z","timestamp":1457377815000},"page":"608-622","source":"Crossref","is-referenced-by-count":299,"title":["An Overview of Low-Rank Matrix Recovery From Incomplete Observations"],"prefix":"10.1109","volume":"10","author":[{"given":"Mark A.","family":"Davenport","sequence":"first","affiliation":[]},{"given":"Justin","family":"Romberg","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref38","first-page":"3129","article-title":"Large-scale SVD and manifold learning","volume":"14","author":"talwalkar","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1364\/COSI.2014.CW4C.1"},{"key":"ref32","article-title":"Compressive sampling of ensembles of correlated signals","author":"ahmed","year":"2015"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/gamm.201410010"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/070697835"},{"key":"ref37","doi-asserted-by":"crossref","DOI":"10.1201\/b16113","author":"hogben","year":"2013","journal-title":"Handbook of Linear Algebra"},{"key":"ref36","article-title":"Matrix rank minimization with applications","author":"fazel","year":"2002"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511810817"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/141002165"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref29","first-page":"3413","article-title":"A simpler approach to matrix completion","volume":"12","author":"recht","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2133806.2133826"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.002"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.4171\/022-3\/69"},{"key":"ref101","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref100","first-page":"638","article-title":"Fast matrix completion without the condition number","author":"hardt","year":"0","journal-title":"Proc Conf Learn Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2104999"},{"key":"ref50","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"0","journal-title":"Proc Adv Neural Process Syst (NIPS)"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1137\/120876459"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/07069239X"},{"key":"ref57","article-title":"Efficient algorithms for collaborative filtering","author":"keshavan","year":"2012"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488693"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2009.2018223"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2009.263"},{"key":"ref53","author":"larsen","year":"1998","journal-title":"PROPACK Software Package"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827597327309"},{"key":"ref40","volume":"3","author":"mahoney","year":"2011","journal-title":"Randomized algorithms for matrices and data"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/090755436"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-006-0040-1"},{"key":"ref5","first-page":"groenen","author":"borg","year":"2010","journal-title":"Modern Multidimensional Scaling"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0709842104"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-013-0053-8"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1149283.1149286"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/090750688"},{"key":"ref46","first-page":"33","article-title":"GoDec: Randomized low-rank and sparse matrix decomposition in noisy case","author":"zhou","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref45","first-page":"2287","article-title":"Spectral regularization algorithms for learning large incomplete matrices","volume":"11","author":"mazumder","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-002-0352-8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-004-0564-1"},{"key":"ref42","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9569-8_10","article-title":"Proximal splitting methods in signal processing","author":"combettes","year":"2011","journal-title":"Fixed-Point Algorithms For Inverse Problems in Science and Engineering"},{"key":"ref41","author":"parikh","year":"2013","journal-title":"Proximal algorithms"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/080716542"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/080738970"},{"key":"ref127","doi-asserted-by":"publisher","DOI":"10.1364\/AO.21.002758"},{"key":"ref126","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-013-0738-9"},{"key":"ref125","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2014.2364225"},{"key":"ref124","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.09.004"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1007\/11503415_37"},{"key":"ref72","first-page":"1329","article-title":"Maximum margin matrix factorization","author":"srebro","year":"0","journal-title":"Proc Adv Neural Process Syst (NIPS)"},{"key":"ref129","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2399924"},{"key":"ref71","article-title":"Conjugate gradient acceleration of iteratively re-weighted least squares methods","author":"fornasier","year":"2015"},{"key":"ref128","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2448516"},{"key":"ref70","first-page":"3441","article-title":"Iterative reweighted algorithms for matrix rank minimization","author":"mohan","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2144977"},{"key":"ref130","article-title":"The local convexity of solving systems of quadratic equations","author":"white","year":"2015"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ACC.2003.1243393"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2054251"},{"key":"ref133","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2294644"},{"key":"ref134","article-title":"Identifiability in blind deconvolution with subspace or sparsity constraints","author":"li","year":"2015"},{"key":"ref131","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2014.2352673"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308.006"},{"key":"ref132","article-title":"Fundamental limits of blind deconvolution—Part I: Ambiguity kernel","author":"choudhary","year":"2014"},{"key":"ref79","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1214\/aos\/1015957395","article-title":"Adaptive estimation of a quadratic functional by model selection","volume":"28","author":"laurent","year":"2000","journal-title":"Ann Statist"},{"key":"ref136","doi-asserted-by":"publisher","DOI":"10.1201\/9781420007299"},{"key":"ref135","author":"haykin","year":"1994","journal-title":"Blind Deconvolution"},{"key":"ref138","doi-asserted-by":"publisher","DOI":"10.1088\/0266-5611\/31\/11\/115002"},{"key":"ref137","doi-asserted-by":"publisher","DOI":"10.1109\/5.720247"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1088\/0954-898X\/7\/2\/014"},{"key":"ref139","doi-asserted-by":"publisher","DOI":"10.1109\/SAMPTA.2015.7148871"},{"key":"ref62","article-title":"Near optimal compressed sensing of sparse rank-one matrices via sparse power factorization","author":"lee","year":"2013"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1364\/JOSAA.16.001587"},{"key":"ref63","first-page":"1","article-title":"Learning sparsely used overcomplete dictionaries","volume":"35","author":"agarwal","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref64","article-title":"Low-rank solutions of linear matrix equations via Procrustes flow","author":"tu","year":"2015"},{"key":"ref140","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2543462"},{"key":"ref65","article-title":"Dropping convexity for faster semi-definite optimization","author":"bhojanapalli","year":"2015"},{"key":"ref141","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaw012"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1145\/1824777.1824783"},{"key":"ref67","first-page":"427","article-title":"Revisiting Frank-Wolfe: Projection-free sparse convex optimization","author":"jaggi","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref68","first-page":"471","article-title":"A simple algorithm for nuclear norm regularized problems","author":"jaggi","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2366459"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1137\/100811404"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2173722"},{"key":"ref109","first-page":"1907","article-title":"Preference completion: Large-scale collaborative ranking form pairwise comparisons","author":"park","year":"0","journal-title":"Proc Int Conf Machine Learning (ICML)"},{"key":"ref95","article-title":"High dimensional matrix estimation with unknown variance of the noise","author":"ga\u00efffas","year":"2011"},{"key":"ref108","article-title":"Individualized rank aggregration using nuclear norm regularization","author":"lu","year":"2014"},{"key":"ref94","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2136318"},{"key":"ref107","author":"david","year":"1963","journal-title":"The Method of Paired Comparisons"},{"key":"ref93","doi-asserted-by":"publisher","DOI":"10.1214\/11-EJS637"},{"key":"ref106","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2015.2497543"},{"key":"ref92","doi-asserted-by":"publisher","DOI":"10.1214\/10-AOS860"},{"key":"ref105","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2220378"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref104","article-title":"Noisy matrix completion under sparse factor models","author":"soni","year":"2014"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS894"},{"key":"ref103","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2015.7086879"},{"key":"ref102","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":"ref111","first-page":"1727","article-title":"Probabilistic low-rank matrix completion on finite alphabets","author":"lafond","year":"0","journal-title":"Proc Adv Neural Process Syst (NIPS)"},{"key":"ref112","doi-asserted-by":"publisher","DOI":"10.1214\/15-EJS1093"},{"key":"ref110","first-page":"1900","article-title":"Collaboratively learning preferences from ordinal data","author":"oh","year":"2015","journal-title":"Proc Adv in Neural Processing Systems (NIPS)"},{"key":"ref98","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-011-9099-z"},{"key":"ref99","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2014.75"},{"key":"ref96","doi-asserted-by":"publisher","DOI":"10.1214\/11-AOS926"},{"key":"ref97","doi-asserted-by":"publisher","DOI":"10.1109\/18.985947"},{"key":"ref10","author":"van der linden","year":"2010","journal-title":"Handbook of Modern Item Response Theory"},{"key":"ref11","first-page":"1959","article-title":"Sparse factor analysis for learning and content analytics","volume":"15","author":"lan","year":"2014","journal-title":"J Mach Learn Res"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/138859.138867"},{"key":"ref13","article-title":"Learning with matrix factorizations","author":"srebro","year":"2004"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102441"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1080\/14786440109462720"},{"key":"ref118","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2005.07.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1037\/h0071325"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref117","article-title":"Phase transitions and sample complexity in Bayes-optimal matrix factorization","author":"kabashima","year":"2014"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5040-8"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2259164"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-008-9111-x"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau005"},{"key":"ref119","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.21432"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/aris.1440380105"},{"key":"ref83","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033977"},{"key":"ref114","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2500192"},{"key":"ref113","doi-asserted-by":"publisher","DOI":"10.1109\/CAMSAP.2015.7383813"},{"key":"ref116","first-page":"1224","article-title":"Low rank matrix completion with exponential family noise","author":"lafond","year":"0","journal-title":"Proc Conf Learning Theory (COLT)"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033976"},{"key":"ref115","first-page":"3964","article-title":"Exponential family matrix completion under structural constraints","author":"gunasekar","year":"0","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref120","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-013-9305-2"},{"key":"ref89","first-page":"1665","article-title":"Restricted strong convexity and weighted matrix completion: Optimal bounds with noise","volume":"13","author":"negahban","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref121","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-013-9162-z"},{"key":"ref122","article-title":"Low rank matrix recovery from rank one measurements","author":"kueng","year":"2014"},{"key":"ref123","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2429594"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0081737"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2415195"},{"key":"ref87","first-page":"2999","article-title":"Completing any low-rank matrix, provably","volume":"16","author":"chen","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref88","first-page":"2057","article-title":"Matrix completion from noisy entries","volume":"11","author":"keshavan","year":"2010","journal-title":"J Mach Learn Res"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/4200690\/7469412\/7426724-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/7469412\/07426724.pdf?arnumber=7426724","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,14]],"date-time":"2022-06-14T16:30:44Z","timestamp":1655224244000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7426724\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6]]},"references-count":141,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2016.2539100","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6]]}}}