{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:23:31Z","timestamp":1756189411057,"version":"3.37.3"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"DARPA Young Faculty","award":["N66001-14-1-4047"],"award-info":[{"award-number":["N66001-14-1-4047"]}]},{"name":"ADC Fellowship"},{"DOI":"10.13039\/100008163","name":"Digital Technology Center, University of Minnesota","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100008163","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/tsp.2020.2996374","type":"journal-article","created":{"date-parts":[[2020,5,21]],"date-time":"2020-05-21T21:01:16Z","timestamp":1590094876000},"page":"3325-3340","source":"Crossref","is-referenced-by-count":2,"title":["A Provably Communication-Efficient Asynchronous Distributed Inference Method for Convex and Nonconvex Problems"],"prefix":"10.1109","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0174-9366","authenticated-orcid":false,"given":"Jineng","family":"Ren","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1570-7071","authenticated-orcid":false,"given":"Jarvis","family":"Haupt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2012.2228038"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2016.7869154"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2015.2403799"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2015.7178668"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2835384"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646514"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-01357-w"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637317"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2017.2695121"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2018.8636055"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/16M1084316"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619047"},{"key":"ref2","volume":"1","author":"friedman","year":"2001","journal-title":"The Elements of Statistical Learning"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/501416.501432"},{"key":"ref20","first-page":"79","article-title":"High-performance distributed ML at scale through parameter server consistency models","author":"dai","year":"0","journal-title":"Proc 29th AAAI Conf Artif Intell"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-017-0376-0"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2293126"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2684748"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0170-0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461520"},{"key":"ref50","first-page":"2595","article-title":"Parallelized stochastic gradient descent","author":"zinkevich","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01369-0"},{"key":"ref59","first-page":"1865","article-title":"Regularization techniques for learning with matrices","volume":"13","author":"kakade","year":"2012","journal-title":"J Mach Learn Res"},{"key":"ref58","first-page":"1529","article-title":"Prox-PDA: The proximal primal-dual algorithm for fast distributed nonconvex optimization and learning over networks","author":"hong","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1137\/090774100"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1137\/140990309"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/130921428"},{"key":"ref54","first-page":"1000","article-title":"Communication-efficient distributed optimization using an approximate Newton-type method","volume":"32","author":"shamir","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref53","first-page":"3068","article-title":"Communication-efficient distributed dual coordinate ascent","author":"jaggi","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref52","first-page":"1973","article-title":"Adding vs. averaging in distributed primal-dual optimization","author":"ma","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref10","first-page":"3636","article-title":"Efficient distributed learning with sparsity","author":"wang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.2018.1429274"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref13","first-page":"693","article-title":"Hogwild: A lock-free approach to parallelizing stochastic gradient descent","author":"recht","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref15","volume":"23","author":"bertsekas","year":"1989","journal-title":"Parallel and Distributed Computation Numerical Methods"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2640087.2644155"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/GlobalSIP.2018.8646525"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-019-01408-w"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1137\/140961134"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1198\/106186006X113430"},{"key":"ref3","first-page":"1017","article-title":"ICA with reconstruction cost for efficient overcomplete feature learning","author":"le","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426626"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref8","first-page":"19","article-title":"Communication efficient distributed machine learning with the parameter server","author":"li","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref7","first-page":"321","article-title":"Parallel coordinate descent for L1-regularized loss minimization","author":"bradley","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2017.2658732"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2537271"},{"key":"ref46","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"0","journal-title":"Proc Advances Neural Inf Process Syst"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2009.4960418"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2014.7028543"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426691"},{"key":"ref42","first-page":"362","article-title":"Disco: Distributed optimization for self-concordant empirical loss","author":"zhang","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1072-9"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1355-4"},{"key":"ref43","first-page":"1701","article-title":"Asynchronous distributed ADMM for consensus optimization","author":"zhang","year":"0","journal-title":"Proc Int Conf Mach Learn"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/8933520\/09098031.pdf?arnumber=9098031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T14:41:19Z","timestamp":1651070479000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9098031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":59,"URL":"https:\/\/doi.org\/10.1109\/tsp.2020.2996374","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"type":"print","value":"1053-587X"},{"type":"electronic","value":"1941-0476"}],"subject":[],"published":{"date-parts":[[2020]]}}}