{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,23]],"date-time":"2026-03-23T14:40:51Z","timestamp":1774276851708,"version":"3.50.1"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Basic Research Program of China (973 Program)","doi-asserted-by":"crossref","award":["2013CB336500"],"award-info":[{"award-number":["2013CB336500"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61233011"],"award-info":[{"award-number":["61233011"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"National Youth Top-notch Talent Support Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2017,6,1]]},"DOI":"10.1109\/tpami.2016.2578323","type":"journal-article","created":{"date-parts":[[2016,6,8]],"date-time":"2016-06-08T14:17:41Z","timestamp":1465395461000},"page":"1223-1236","source":"Crossref","is-referenced-by-count":17,"title":["Sparse Learning with Stochastic Composite Optimization"],"prefix":"10.1109","volume":"39","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7311-0698","authenticated-orcid":false,"given":"Weizhong","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhongming","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rong","family":"Jin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Deng","family":"Cai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuelong","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronghua","family":"Liang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaofei","family":"He","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"980","article-title":"Linear convergence with condition number independent access of full gradients","author":"zhang","year":"0","journal-title":"Proc Adv Neu Inf Proc Sys"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814157"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0149-x"},{"key":"ref13","article-title":"A sparsity preserving stochastic gradient method for composite optimization","volume":"15213","author":"lin","year":"2011","journal-title":"Carnegie Mellon Univ"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/110831659"},{"key":"ref15","first-page":"781","article-title":"Accelerated gradient methods for stochastic optimization and online learning","author":"hu","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","article-title":"Gradient methods for minimizing composite objective function","author":"nesterov","year":"2007","journal-title":"CORE Discussion Papers"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0434-y"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-08-094829-4.50022-2"},{"key":"ref19","first-page":"267","article-title":"Data-driven online to batch conversions","author":"dekel","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-012-0629-5"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2015.2456899"},{"key":"ref3","first-page":"2543","article-title":"Dual averaging methods for regularized stochastic learning and online optimization","volume":"11","author":"xiao","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","volume":"87","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.1096"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2016.2578323"},{"key":"ref8","first-page":"449","article-title":"Making gradient descent optimal for strongly convex stochastic optimization","author":"rakhlin","year":"0","journal-title":"Proc 29th Int Conf Mach Learn"},{"key":"ref7","first-page":"777","article-title":"Sparse online learning via truncated gradient","volume":"10","author":"langford","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref2","first-page":"404","article-title":"Optimal regularized dual averaging methods for stochastic optimization","author":"chen","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","first-page":"421","article-title":"Beyond the regret minimization barrier: An optimal algorithm for stochastic strongly-convex optimization","author":"hazan","year":"0","journal-title":"Proc 24th Annu Conf Learn Theory"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/110848864"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1002\/cpa.20303"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/090756855"},{"key":"ref21","first-page":"3869","article-title":"Iteratively reweighted algorithms for compressive sensing","author":"chartrand","year":"0","journal-title":"Proc IEEE Int Conf Acoust Speech Signal Process"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23783-6_34"},{"key":"ref23","first-page":"2899","article-title":"Efficient online and batch learning using forward backward splitting","volume":"10","author":"duchi","year":"2009","journal-title":"J Mach Learn Res"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1214\/ECP.v16-1624"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s00365-009-9070-2"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7919342\/07486981.pdf?arnumber=7486981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:39:24Z","timestamp":1641987564000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7486981\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6,1]]},"references-count":29,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2016.2578323","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"value":"0162-8828","type":"print"},{"value":"2160-9292","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6,1]]}}}