{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,10]],"date-time":"2026-06-10T07:51:15Z","timestamp":1781077875887,"version":"3.54.1"},"reference-count":28,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/USG.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2013,1]]},"DOI":"10.1109\/tit.2012.2207945","type":"journal-article","created":{"date-parts":[[2012,9,4]],"date-time":"2012-09-04T18:03:09Z","timestamp":1346781789000},"page":"482-494","source":"Crossref","is-referenced-by-count":286,"title":["Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach"],"prefix":"10.1109","volume":"59","author":[{"given":"Yaniv","family":"Plan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Roman","family":"Vershynin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.105.150401"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2010.5464825"},{"key":"ref12","author":"gunturk","year":"0","journal-title":"Sobolev duals for random frames and sigma-delta quantization of compressed sensing measurements"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513510"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2234823"},{"key":"ref15","author":"shamir","year":"0","journal-title":"Learning exponential families in high-dimensions Strong convexity and sparsity"},{"key":"ref16","author":"laska","year":"2011","journal-title":"Regime change Sampling rate vs bit-depth in compressive sensing"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2194710"},{"key":"ref18","author":"ledoux","year":"2001","journal-title":"The Concentration of Measure Phenomenon"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4"},{"key":"ref28","author":"vershynin","year":"0","journal-title":"Compressed Sensing Theory and Applications"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2010.5495766"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/009053607000000929"},{"key":"ref3","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"bartlett","year":"2003","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1214\/08-EJS287"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2008.4558487"},{"key":"ref8","year":"2012","journal-title":"Compressed sensing"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/09-EJS521"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/0-306-48658-X_3"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2009.5206076"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9868.2007.00627.x"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-013-9561-6"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1214\/12-STS400"},{"key":"ref24","first-page":"251","article-title":"Minimax rates of convergence for high-dimensional regression under <formula formulatype=\"inline\"><tex Notation=\"TeX\">$\\ell{\\rm q}$<\/tex><\/formula>-ball sparsity","author":"raskutti","year":"2009","journal-title":"Proc 47th Annu Allert Conf IEEE Commun Control Comput"},{"key":"ref23","author":"plan","year":"0","journal-title":"One-bit compressed sensing by linear programming"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/aop\/1065725175"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1214\/09-AOS691"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6387658\/06294516.pdf?arnumber=6294516","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,11]],"date-time":"2021-10-11T01:37:42Z","timestamp":1633916262000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6294516\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,1]]},"references-count":28,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tit.2012.2207945","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,1]]}}}