{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T23:17:36Z","timestamp":1776122256621,"version":"3.50.1"},"reference-count":74,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/501100001691","name":"Japan Society for the Promotion of Science","doi-asserted-by":"publisher","award":["Core-To-Core Program"],"award-info":[{"award-number":["Core-To-Core Program"]}],"id":[{"id":"10.13039\/501100001691","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["ERC SPARCS 307087"],"award-info":[{"award-number":["ERC SPARCS 307087"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2016,7]]},"DOI":"10.1109\/tit.2016.2556702","type":"journal-article","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T18:24:44Z","timestamp":1461176684000},"page":"4228-4265","source":"Crossref","is-referenced-by-count":77,"title":["Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization"],"prefix":"10.1109","volume":"62","author":[{"given":"Yoshiyuki","family":"Kabashima","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2313-2578","authenticated-orcid":false,"given":"Florent","family":"Krzakala","sequence":"additional","affiliation":[]},{"given":"Marc","family":"Mezard","sequence":"additional","affiliation":[]},{"given":"Ayaka","family":"Sakata","sequence":"additional","affiliation":[]},{"given":"Lenka","family":"Zdeborova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620309"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178325"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875083"},{"key":"ref70","first-page":"236","article-title":"Understanding belief propagation and its generalizations","author":"yedidia","year":"2003","journal-title":"Exploring Artificial Intelligence in the New Millennium"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875146"},{"key":"ref39","article-title":"Sample complexity of dictionary learning and other matrix factorizations","author":"gribonval","year":"2013"},{"key":"ref38","article-title":"A clustering approach to learn sparsely-used overcomplete dictionaries","author":"agarwal","year":"2013"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2005.06.035"},{"key":"ref32","doi-asserted-by":"crossref","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","article-title":"K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation","volume":"54","author":"aharon","year":"2006","journal-title":"IEEE Trans Signal Process"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.1999.760624"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1162\/089976600300015826"},{"key":"ref37","article-title":"New algorithms for learning incoherent and overcomplete dictionaries","author":"arora","year":"2013"},{"key":"ref36","first-page":"3087","article-title":"Exact recovery of sparsely-used dictionaries","author":"spielman","year":"2013","journal-title":"Proc 23rd Int Joint Conf Artif Intell"},{"key":"ref35","article-title":"Local stability and robustness of sparse dictionary learning in the presence of noise","author":"jenatton","year":"2012"},{"key":"ref34","first-page":"3259","article-title":"The sample complexity of dictionary learning","volume":"12","author":"vainsencher","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1002\/ett.1289"},{"key":"ref62","first-page":"1","article-title":"Maximum likelihood from incomplete data via the EM algorithm","volume":"38","author":"dempster","year":"1977","journal-title":"J R Statist Soc B (Methodological)"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2009\/09\/L09003"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2012\/08\/P08009"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447070"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2011.6190117"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2016.2539100"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2011.6033942"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289343"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1109\/18.910572"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1080\/14786437708235992"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464768"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1038\/nature14539"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.50"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1126\/science.1073287"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2002.804053"},{"key":"ref21","article-title":"Proof of the satisfiability conjecture for large k","author":"ding","year":"2014"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ITW.2006.1633802"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.847700"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iau006"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"ref50","first-page":"2080","article-title":"Robust principal component analysis: Exact recovery of corrupted low-rank matrices via convex optimization","author":"wright","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283056"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1015"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1209\/0295-5075\/1\/2\/006"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283053"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198509417.001.0001"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1088\/0305-4470\/32\/21\/302"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-213-7.50011-0"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875223"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1970392.1970395"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/97.752062"},{"key":"ref12","volume":"9","author":"m\u00e9zard","year":"1987","journal-title":"Spin Glass Theory and Beyond An Introduction to the Replica Method and Its Applications"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198570837.001.0001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620310"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2013.6620308"},{"key":"ref16","article-title":"Bilinear generalized approximate message passing (BiG-AMP) for matrix recovery problem","author":"schniter","year":"2012","journal-title":"Inf Theory Appl Workshop (ITA)"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357776"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2357773"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/LSP.2012.2224655"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/S0042-6989(97)00169-7"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1038\/381607a0"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1162\/089976603762552951"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-009-9045-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/78.554307"},{"key":"ref49","article-title":"Sparse and low-rank matrix decomposition via alternating direction methods","author":"yuan","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2044061"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2009.2035722"},{"key":"ref45","first-page":"323","article-title":"A survey of sparse component analysis for blind source separation: Principles, perspectives, and new challenges","author":"gribonval","year":"2006","journal-title":"Proc Euro Symp Artif Neural Netw (ESANN)"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394889"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2046205"},{"key":"ref42","doi-asserted-by":"crossref","first-page":"2353","DOI":"10.1016\/S0165-1684(01)00120-7","article-title":"Underdetermined blind source separation using sparse representations","volume":"81","author":"bofill","year":"2001","journal-title":"Signal Process"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1162\/089976601300014385"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/050645506"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2005.849840"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/iel7\/18\/7491395\/07457269.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/7491395\/07457269.pdf?arnumber=7457269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:26:21Z","timestamp":1642004781000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7457269\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":74,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tit.2016.2556702","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7]]}}}