{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T01:24:10Z","timestamp":1773797050654,"version":"3.50.1"},"reference-count":16,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1109\/isit.2015.7282733","type":"proceedings-article","created":{"date-parts":[[2015,10,1]],"date-time":"2015-10-01T18:09:52Z","timestamp":1443722992000},"page":"1635-1639","source":"Crossref","is-referenced-by-count":39,"title":["Phase transitions in sparse PCA"],"prefix":"10.1109","author":[{"given":"Thibault","family":"Lesieur","sequence":"first","affiliation":[]},{"given":"Florent","family":"Krzakala","sequence":"additional","affiliation":[]},{"given":"Lenka","family":"Zdeborova","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","first-page":"917","article-title":"Low-rank matrix reconstruction and clustering via approximate message passing","author":"matsushita","year":"2013","journal-title":"Advances in neural information processing systems"},{"key":"ref11","article-title":"Computational lower bounds for sparse pea","author":"berthet","year":"2013","journal-title":"arXiv preprint arXiv 1304 0828"},{"key":"ref12","article-title":"Phase transitions and sample complexity in bayes-optimal matrix factorization","author":"kabashima","year":"2014","journal-title":"arXiv preprint arXiv 1402 1298"},{"key":"ref13","article-title":"Understanding belief propagation and its generalizations","author":"yedidia","year":"2003","journal-title":"Exploring Artificial Intelligence in the New Millennium"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2274513"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.69.026124"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/009117905000000233"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.0121"},{"key":"ref3","first-page":"915","article-title":"Spectral bounds for sparse pea: Exact and greedy algorithms","author":"moghaddam","year":"2005","journal-title":"Advances in neural information processing systems"},{"key":"ref6","article-title":"Do semidefinite relaxations really solve sparse pea?","author":"krauthgamer","year":"2013","journal-title":"arXiv preprint arXiv 1306 3690"},{"key":"ref5","first-page":"1269","article-title":"Optimal solutions for sparse principal component analysis","volume":"9","author":"d'aspremont","year":"2008","journal-title":"The Journal of Machine Learning Research"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1214\/08-AOS664"},{"key":"ref7","first-page":"334","article-title":"Sparse pea via covariance thresholding","author":"deshpande","year":"2014","journal-title":"Adv in Neural Info Proc Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2014.6875223"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6283056"}],"event":{"name":"2015 IEEE International Symposium on Information Theory (ISIT)","location":"Hong Kong, Hong Kong","start":{"date-parts":[[2015,6,14]]},"end":{"date-parts":[[2015,6,19]]}},"container-title":["2015 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7270906\/7282397\/07282733.pdf?arnumber=7282733","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,24]],"date-time":"2017-03-24T16:04:33Z","timestamp":1490371473000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7282733\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,6]]},"references-count":16,"URL":"https:\/\/doi.org\/10.1109\/isit.2015.7282733","relation":{},"subject":[],"published":{"date-parts":[[2015,6]]}}}