{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T05:49:41Z","timestamp":1725428981640},"reference-count":31,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1109\/allerton.2017.8262790","type":"proceedings-article","created":{"date-parts":[[2018,1,18]],"date-time":"2018-01-18T18:03:47Z","timestamp":1516298627000},"page":"588-595","source":"Crossref","is-referenced-by-count":0,"title":["Learning mixtures of sparse linear regressions using sparse graph codes"],"prefix":"10.1109","author":[{"given":"Dong","family":"Yin","sequence":"first","affiliation":[]},{"given":"Ramtin","family":"Pedarsani","sequence":"additional","affiliation":[]},{"given":"Yudong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref31","article-title":"Stochastic integration via error-correcting codes","author":"achlioptas","year":"2015","journal-title":"UAI"},{"journal-title":"Iterative Hessian sketch Fast and accurate solution approximation for constrained least-squares","year":"2014","author":"pilanci","key":"ref30"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00222867"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852309"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282923"},{"journal-title":"Statistical guarantees for the EM algorithm From population to sample-based analysis","year":"2014","author":"balakrishnan","key":"ref14"},{"key":"ref15","first-page":"613","article-title":"Alternating minimization for mixed linear regression","author":"yi","year":"2014","journal-title":"ICML"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s11749-010-0197-z"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/00949650802590261"},{"journal-title":"Solving a mixture of many random linear equations by tensor decomposition and alternating minimization","year":"2016","author":"yi","key":"ref18"},{"journal-title":"A convex formulation for mixed regression with two components Minimax optimal rates","year":"2013","author":"chen","key":"ref19"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693287"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(89)90043-1"},{"journal-title":"Sub-linear time support recovery for compressed sensing using sparse-graph codes","year":"2014","author":"li","key":"ref27"},{"journal-title":"Guess who rated this movie Identifying users through subspace clustering","year":"2012","author":"zhang","key":"ref3"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/0470846313.ch6"},{"key":"ref29","first-page":"2160","article-title":"Nearest neighbor based greedy coordinate descent","author":"dhillon","year":"2011","journal-title":"NIPS"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1097\/01.psy.0000239144.91689.ca"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020779827503"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/dspr.1999.0361"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1088\/0954-898X\/9\/4\/001"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47977-5_36"},{"key":"ref20","first-page":"1040","article-title":"Spectral experts for estimating mixtures of linear regressions","author":"chaganty","year":"2013","journal-title":"ICML"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref21","first-page":"721","article-title":"Learning mixtures of linear classifiers","author":"sun","year":"2014","journal-title":"ICML"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447061"},{"key":"ref23","first-page":"2161","article-title":"An active learning framework using sparse-graph codes for sparse polynomials and graph sketching","author":"li","year":"2015","journal-title":"NIPS"},{"key":"ref26","first-page":"271","article-title":"Low-density parity constraints for hashing-based discrete integration","author":"ermon","year":"2014","journal-title":"ICML"},{"key":"ref25","first-page":"702","article-title":"Low rank approximation using error correcting coding matrices","author":"ubaru","year":"2015","journal-title":"ICML"}],"event":{"name":"2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)","start":{"date-parts":[[2017,10,3]]},"location":"Monticello, IL, USA","end":{"date-parts":[[2017,10,6]]}},"container-title":["2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8253908\/8262705\/08262790.pdf?arnumber=8262790","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,2,28]],"date-time":"2018-02-28T16:24:02Z","timestamp":1519835042000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8262790\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10]]},"references-count":31,"URL":"https:\/\/doi.org\/10.1109\/allerton.2017.8262790","relation":{},"subject":[],"published":{"date-parts":[[2017,10]]}}}