{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T16:35:39Z","timestamp":1772296539632,"version":"3.50.1"},"reference-count":54,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,11,1]],"date-time":"2017-11-01T00:00:00Z","timestamp":1509494400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000879","name":"Alfred P. Sloan Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000879","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF CAREER award","doi-asserted-by":"publisher","award":["1348721"],"award-info":[{"award-number":["1348721"]}],"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":[[2017,11]]},"DOI":"10.1109\/tit.2017.2749330","type":"journal-article","created":{"date-parts":[[2017,9,5]],"date-time":"2017-09-05T18:15:03Z","timestamp":1504635303000},"page":"6869-6895","source":"Crossref","is-referenced-by-count":57,"title":["Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints"],"prefix":"10.1109","volume":"63","author":[{"given":"Nam","family":"Nguyen","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8058-8638","authenticated-orcid":false,"given":"Deanna","family":"Needell","sequence":"additional","affiliation":[]},{"given":"Tina","family":"Woolf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/100802001"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/15M1014425"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390273"},{"key":"ref32","first-page":"161","article-title":"The tradeoffs of large scale learning","author":"bousquet","year":"2007","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref31","first-page":"127","article-title":"Gradient hard thresholding pursuit for sparsity-constrained optimization","author":"yuan","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref30","first-page":"937","article-title":"Guaranteed rank minimization via singular value projection","author":"jain","year":"2010","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref37","first-page":"335","article-title":"Angenaherte auflosung von systemen linearer gleichungen","volume":"35","author":"kaczmarz","year":"1937","journal-title":"Bull Int Acad Polon Sci Lett A"},{"key":"ref36","first-page":"451","article-title":"Non-asymptotic analysis of stochastic approximation algorithms for machine learning","author":"bach","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2604-3_16"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2014.07.004"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1016\/j.laa.2013.03.004"},{"key":"ref29","first-page":"1348","article-title":"A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers","author":"negahban","year":"2009","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref2","author":"nguyen","year":"2013","journal-title":"A unified iterative greedy algorithm for sparsity-constrained optimization"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-012-9135-7"},{"key":"ref20","first-page":"329","article-title":"Large-scale convex minimization with a low-rank constraint","author":"shalev-shwartz","year":"2011","journal-title":"Proc 28th Int Conf Mach Learn (ICML)"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146690"},{"key":"ref21","first-page":"1377","article-title":"Forward basis selection for sparse approximation over dictionary","author":"yuan","year":"2012","journal-title":"Proc 14th Int Conf Artif Intell Statist (AISTATS)"},{"key":"ref24","first-page":"807","article-title":"Greedy sparsity-constrained optimization","volume":"14","author":"bahmani","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref23","first-page":"1935","article-title":"On learning discrete graphical models using greedy methods","author":"jalali","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2011.2174985"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2273491"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1137\/090771806"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s00211-010-0331-6"},{"key":"ref54","author":"bertsekas","year":"2003","journal-title":"Convex Analysis and Optimization"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536446"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1561\/0400000060"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20124"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910971"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0614-z"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2007.910281"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20042"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1214\/12-AOS1032"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2004.834793"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2010.2042412"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2162263"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0772-0_5"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/090759574"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2008.07.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1016\/j.acha.2009.04.002"},{"key":"ref6","first-page":"1017","article-title":"Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm","author":"needell","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00041-008-9030-4"},{"key":"ref8","year":"0","journal-title":"Compressed Sensing Webpage"},{"key":"ref7","first-page":"1433","article-title":"Compressive sampling","volume":"3","author":"cand\u00e8s","year":"2006","journal-title":"Proc Int Congr Math"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2111771"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2005.858979"},{"key":"ref46","author":"shen","year":"2016","journal-title":"A tight bound of hard thresholding"},{"key":"ref45","first-page":"1","article-title":"Accelerated stochastic block coordinate gradient descent for sparsity constrained nonconvex optimization","author":"chen","year":"2016","journal-title":"Proc Conf Uncertainty Artif Intell"},{"key":"ref48","author":"garnatz","year":"2014","journal-title":"Practical approximate projection schemes in greedy signal space methods"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2146550"},{"key":"ref42","author":"schmidt","year":"2013","journal-title":"Minimizing finite sums with the stochastic average gradient"},{"key":"ref41","first-page":"567","article-title":"Stochastic dual coordinate ascent methods for regularized loss minimization","volume":"14","author":"shalev-shwartz","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref44","author":"li","year":"2016","journal-title":"Nonconvex sparse learning via stochastic optimization with progressive variance reduction"},{"key":"ref43","volume":"65","author":"spall","year":"2005","journal-title":"Introduction to Stochastic Search and Optimization Estimation Simulation and Control"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/18\/8071168\/8025727-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8071168\/08025727.pdf?arnumber=8025727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:52:27Z","timestamp":1649443947000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/8025727\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11]]},"references-count":54,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tit.2017.2749330","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11]]}}}