{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:46:54Z","timestamp":1774946814781,"version":"3.50.1"},"reference-count":46,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,3,1]],"date-time":"2019-03-01T00:00:00Z","timestamp":1551398400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Berkeley DeepDrive Industry Consortium"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1755808"],"award-info":[{"award-number":["CCF-1755808"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1657420"],"award-info":[{"award-number":["1657420"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1704828"],"award-info":[{"award-number":["CCF-1704828"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1527767"],"award-info":[{"award-number":["CCF-1527767"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1109\/tit.2018.2864276","type":"journal-article","created":{"date-parts":[[2018,8,8]],"date-time":"2018-08-08T18:53:08Z","timestamp":1533754388000},"page":"1430-1451","source":"Crossref","is-referenced-by-count":10,"title":["Learning Mixtures of Sparse Linear Regressions Using Sparse Graph Codes"],"prefix":"10.1109","volume":"65","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2358-0816","authenticated-orcid":false,"given":"Dong","family":"Yin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1126-0292","authenticated-orcid":false,"given":"Ramtin","family":"Pedarsani","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6416-5635","authenticated-orcid":false,"given":"Yudong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Kannan","family":"Ramchandran","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"22","article-title":"Stochastic integration via error-correcting codes","author":"achlioptas","year":"2015","journal-title":"Proc Conf Uncertainty of Artificial Intelligence"},{"key":"ref38","first-page":"1842","article-title":"Iterative Hessian sketch: Fast and accurate solution approximation for constrained least-squares","volume":"17","author":"pilanci","year":"2016","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-6048-4_22"},{"key":"ref32","volume":"12","author":"du","year":"2000","journal-title":"Combinatorial Group Testing and its Applications"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282923"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2693287"},{"key":"ref37","first-page":"2160","article-title":"Nearest neighbor based greedy coordinate descent","author":"dhillon","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2613870"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541824"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2010.5707017"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1962.1057683"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/18.556667"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2032816"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2034796"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1088\/0954-898X\/9\/4\/001"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/BF00222867"},{"key":"ref15","first-page":"560","article-title":"A convex formulation for mixed regression with two components: Minimax optimal rates","author":"chen","year":"2014","journal-title":"Proc Conf Learn Theory"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1214\/16-AOS1435"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1080\/00949650802590261"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11749-010-0197-z"},{"key":"ref19","first-page":"613","article-title":"Alternating minimization for mixed linear regression","author":"yi","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9473(89)90043-1"},{"key":"ref28","author":"li","year":"2014","journal-title":"Sub-linear time support recovery for compressed sensing using sparse-graph codes"},{"key":"ref3","first-page":"944","article-title":"Guess who rated this movie: Identifying users through subspace clustering","author":"zhang","year":"2012","journal-title":"Proc 28th Conf Uncertainty Artif Intell"},{"key":"ref27","first-page":"271","article-title":"Low-density parity constraints for hashing-based discrete integration","author":"ermon","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.862083"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2016.7852309"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/0470846313.ch6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1097\/01.psy.0000239144.91689.ca"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1006\/dspr.1999.0361"},{"key":"ref1","first-page":"543","article-title":"A framework for high-level feedback to adaptive, per-pixel, mixture-of-Gaussian background models","author":"harville","year":"2002","journal-title":"Proc 7th Eur Conf Comput Vis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1023\/A:1020779827503"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-007-9003-x"},{"key":"ref20","author":"yi","year":"2016","journal-title":"Solving a mixture of many random linear equations by tensor decomposition and alternating minimization"},{"key":"ref45","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"ref22","first-page":"721","article-title":"Learning mixtures of linear classifiers","author":"sun","year":"2014","journal-title":"Proc 31st Int Conf Mach Learn"},{"key":"ref21","first-page":"1040","article-title":"Spectral experts for estimating mixtures of linear regressions","author":"chaganty","year":"2013","journal-title":"Proc 30th Int Conf Mach Learn"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511791338"},{"key":"ref24","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":"Proc Adv Neural Inf Process Syst"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2025528"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2009.2021379"},{"key":"ref44","first-page":"1","article-title":"Extensions of Lipschitz mappings into a Hilbert space","volume":"26","author":"johnson","year":"1984","journal-title":"Contemp Math"},{"key":"ref26","first-page":"702","article-title":"Low rank approximation using error correcting coding matrices","author":"ubaru","year":"2015","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/18.910577"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2015.7447061"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8642547\/8429915-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8642547\/08429915.pdf?arnumber=8429915","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T20:52:14Z","timestamp":1657745534000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8429915\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3]]},"references-count":46,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2864276","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,3]]}}}