{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:20:36Z","timestamp":1740133236221,"version":"3.37.3"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,10,1]],"date-time":"2021-10-01T00:00:00Z","timestamp":1633046400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["CNS-NeTS-1717045","CMMI-SMOR-1562065","CNS-ICN-WEN-1719371","CNS-SpecEES-1824337","CNS-NeTS-2007231"],"award-info":[{"award-number":["CNS-NeTS-1717045","CMMI-SMOR-1562065","CNS-ICN-WEN-1719371","CNS-SpecEES-1824337","CNS-NeTS-2007231"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000006","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N00014-19-1-2621"],"award-info":[{"award-number":["N00014-19-1-2621"]}],"id":[{"id":"10.13039\/100000006","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000774","name":"Defense Threat Reduction Agency","doi-asserted-by":"publisher","award":["HDTRA1-18-1-0050"],"award-info":[{"award-number":["HDTRA1-18-1-0050"]}],"id":[{"id":"10.13039\/100000774","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1109\/tnet.2021.3078054","type":"journal-article","created":{"date-parts":[[2021,6,4]],"date-time":"2021-06-04T19:50:36Z","timestamp":1622836236000},"page":"2045-2058","source":"Crossref","is-referenced-by-count":0,"title":["A Flexible Distributed Stochastic Optimization Framework for Concurrent Tasks in Processing Networks"],"prefix":"10.1109","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6403-5822","authenticated-orcid":false,"given":"Zai","family":"Shi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5560-5806","authenticated-orcid":false,"given":"Atilla","family":"Eryilmaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"journal-title":"Nonlinear Programming","year":"2016","author":"bertsekas","key":"ref32"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"ref30","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"erd?s","year":"1960","journal-title":"Publ Math Inst Hung Acad Sci"},{"key":"ref10","article-title":"Optimal algorithms for smooth and strongly convex distributed optimization in networks","author":"scaman","year":"2017","journal-title":"arXiv 1702 08704"},{"key":"ref11","article-title":"Accelerated distributed Nesterov gradient descent","author":"qu","year":"2017","journal-title":"arXiv 1705 07176"},{"key":"ref12","article-title":"A distributed Newton method for large scale consensus optimization","author":"tutunov","year":"2016","journal-title":"arXiv 1606 06593"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2617829"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-010-9737-7"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2529285"},{"key":"ref16","article-title":"Communication-efficient algorithms for decentralized and stochastic optimization","author":"lan","year":"2017","journal-title":"arXiv 1701 03961"},{"key":"ref17","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2017.2713396"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2018.8619228"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2010.5502548"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref27","article-title":"Network topology and communication-computation tradeoffs in decentralized optimization","author":"nedi?","year":"2017","journal-title":"arXiv 1709 08765"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.1986.1104412"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2011.2161027"},{"key":"ref29","volume":"172","author":"stallings","year":"1998","journal-title":"High-Speed Networks TCP\/IP and ATM Design Principles"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2010.2091295"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304432"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2017.2677879"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/473"},{"key":"ref21","first-page":"5973","article-title":"The convergence of sparsified gradient methods","author":"alistarh","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref24","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","article-title":"Layer-wise adaptive gradient sparsification for distributed deep learning with convergence guarantees","author":"shi","year":"2019","journal-title":"arXiv 1911 08727"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2019.00220"},{"key":"ref25","first-page":"1299","article-title":"Gradient sparsification for communication-efficient distributed optimization","author":"wangni","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/90\/9570755\/9447022-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/9570755\/09447022.pdf?arnumber=9447022","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:49:14Z","timestamp":1649443754000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9447022\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,10]]},"references-count":32,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2021.3078054","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"type":"print","value":"1063-6692"},{"type":"electronic","value":"1558-2566"}],"subject":[],"published":{"date-parts":[[2021,10]]}}}