{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T14:47:20Z","timestamp":1787496440399,"version":"build-2736575974"},"reference-count":35,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T00:00:00Z","timestamp":1554076800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FL-170100117"],"award-info":[{"award-number":["FL-170100117"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["DP-180103424"],"award-info":[{"award-number":["DP-180103424"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF1718513"],"award-info":[{"award-number":["CCF1718513"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"IBM Faculty Award"},{"name":"NEC Fellowship"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Neural Netw. Learning Syst."],"published-print":{"date-parts":[[2019,4]]},"DOI":"10.1109\/tnnls.2018.2866699","type":"journal-article","created":{"date-parts":[[2018,9,12]],"date-time":"2018-09-12T14:45:00Z","timestamp":1536763500000},"page":"1205-1217","source":"Crossref","is-referenced-by-count":11,"title":["Dualityfree Methods for Stochastic Composition Optimization"],"prefix":"10.1109","volume":"30","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4546-2183","authenticated-orcid":false,"given":"Liu","family":"Liu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ji","family":"Liu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7225-5449","authenticated-orcid":false,"given":"Dacheng","family":"Tao","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/470"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/WSC.2016.7822134"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/141000270"},{"key":"ref35","author":"bertsekas","year":"1999","journal-title":"Nonlinear Prog"},{"key":"ref34","volume":"87","author":"nesterov","year":"2013","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref10","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":"ref11","first-page":"747","article-title":"Sdca without duality, regularization, and individual convexity","author":"shalev-shwartz","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref12","first-page":"1159","article-title":"Finite-sum composition optimization via variance reduced gradient descent","author":"lian","year":"2017","journal-title":"Proc AISTATS"},{"key":"ref13","first-page":"1714","article-title":"Accelerating stochastic composition optimization","author":"wang","year":"2016","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref14","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence _rate for finite training sets","author":"roux","year":"2012","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref17","first-page":"2287","article-title":"Accelerated variance reduced stochastic admm","author":"liu","year":"2017","journal-title":"Proc Assoc Advance Artif Intell"},{"key":"ref18","first-page":"2251","article-title":"Stopwasting my gradients: Practical SVRG","author":"harikandeh","year":"2015","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055448"},{"key":"ref28","first-page":"378","article-title":"Accelerated mini-batch stochastic dual coordinate ascent","author":"shalev-shwartz","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2609500"},{"key":"ref27","first-page":"3694","article-title":"Exploiting strong convexity from data with primal-dual first-order algorithms","author":"wang","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2016.2582849"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2015.2503980"},{"key":"ref29","first-page":"3059","article-title":"An accelerated proximal coordinate gradient method","author":"lin","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref5","volume":"1","author":"sutton","year":"1998","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref8","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","author":"johnson","year":"2013","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","first-page":"353","article-title":"Stochastic primal-dual coordinate method for regularized empirical risk minimization","author":"zhang","year":"2015","journal-title":"Proceedings of the 32nd Intl Conf on Machine Learning"},{"key":"ref2","author":"dai","year":"2016","journal-title":"Learning from conditional distributions via dual embeddings"},{"key":"ref9","first-page":"1646","article-title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","author":"defazio","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1017-3"},{"key":"ref20","first-page":"1080","article-title":"Improved SVRG for non-strongly-convex or sum-of-non-convex objectives","author":"allen-zhu","year":"2016","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref22","first-page":"89","article-title":"Natasha: Faster non-convex stochastic optimization via strongly non-convex parameter","author":"allen-zhu","year":"2017","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref21","author":"allen-zhu","year":"2017","journal-title":"Natasha 2 Faster non-convex optimization than SGD"},{"key":"ref24","first-page":"64","article-title":"Accelerated proximal stochastic dual coordinate ascent for regularized loss minimization","author":"shalev-shwartz","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref23","author":"shalev-shwartz","year":"2012","journal-title":"Proximal Stochastic Dual Coordinate Ascent"},{"key":"ref26","first-page":"1529","article-title":"Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","author":"hong","year":"2017","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref25","first-page":"2034","article-title":"Doubly greedy primal-dual coordinate descent for sparse empirical risk minimization","author":"lei","year":"2017","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Neural Networks and Learning Systems"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/5962385\/8668600\/8464090-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/5962385\/8668600\/08464090.pdf?arnumber=8464090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,13]],"date-time":"2022-07-13T16:53:29Z","timestamp":1657731209000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8464090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,4]]},"references-count":35,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tnnls.2018.2866699","relation":{},"ISSN":["2162-237X","2162-2388"],"issn-type":[{"value":"2162-237X","type":"print"},{"value":"2162-2388","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,4]]}}}