{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,10]],"date-time":"2026-07-10T16:37:00Z","timestamp":1783701420933,"version":"3.55.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1109\/acssc.2011.6190117","type":"proceedings-article","created":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T21:16:13Z","timestamp":1335906973000},"page":"799-803","source":"Crossref","is-referenced-by-count":98,"title":["Expectation-maximization Bernoulli-Gaussian approximate message passing"],"prefix":"10.1109","author":[{"given":"Jeremy","family":"Vila","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"Schniter","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.2007606"},{"key":"14","article-title":"Learning with compressible priors","author":"cevher","year":"0","journal-title":"Proc Neural Inform Process Syst Conf (Vancouver B C ) Dec 2009"},{"key":"11","first-page":"355","article-title":"A view of the EM algorithm that justifies incremental, sparse, and other variants","author":"neal","year":"1999","journal-title":"Learning in Graphical Models"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1137\/080714488"},{"key":"3","author":"donoho","year":"2010","journal-title":"The Noise-Sensitivity Phase Transition in Compressed Sensing"},{"key":"2","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0909892106"},{"key":"1","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","article-title":"Regression shrinkage and selection via the lasso","volume":"58","author":"tibshirani","year":"1996","journal-title":"J Roy Statist Soc B"},{"key":"10","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum-likelihood from incomplete data via the EM algorithm","volume":"39","author":"dempster","year":"1977","journal-title":"J Roy Statist Soc"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1162\/15324430152748236"},{"key":"6","author":"rangan","year":"2010","journal-title":"Generalized Approximate Message Passing for Estimation with Random Linear Mixing"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2010.2094817"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1109\/ITWKSPS.2010.5503193"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2007.914345"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.831016"}],"event":{"name":"2011 45th Asilomar Conference on Signals, Systems and Computers","location":"Pacific Grove, CA, USA","start":{"date-parts":[[2011,11,6]]},"end":{"date-parts":[[2011,11,9]]}},"container-title":["2011 Conference Record of the Forty Fifth Asilomar Conference on Signals, Systems and Computers (ASILOMAR)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/6185739\/6189941\/06190117.pdf?arnumber=6190117","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,24]],"date-time":"2024-04-24T02:36:30Z","timestamp":1713926190000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6190117\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/acssc.2011.6190117","relation":{},"subject":[],"published":{"date-parts":[[2011,11]]}}}