{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T17:32:17Z","timestamp":1761845537102,"version":"3.37.3"},"reference-count":63,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T00:00:00Z","timestamp":1648771200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF-17-1-0331"],"award-info":[{"award-number":["W911NF-17-1-0331"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS-1744129"],"award-info":[{"award-number":["ECCS-1744129"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Commonwealth of Pennsylvania"},{"name":"Department of Community and Economic Development"},{"name":"Pennsylvania Infrastructure Technology Alliance"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1618717","CCF-1740796"],"award-info":[{"award-number":["CCF-1618717","CCF-1740796"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2022,4]]},"DOI":"10.1109\/jstsp.2022.3162989","type":"journal-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:04:14Z","timestamp":1648843454000},"page":"585-600","source":"Crossref","is-referenced-by-count":14,"title":["Distributed Learning With Sparsified Gradient Differences"],"prefix":"10.1109","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1876-9320","authenticated-orcid":false,"given":"Yicheng","family":"Chen","sequence":"first","affiliation":[{"name":"Lehigh University, Bethlehem, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1024-6771","authenticated-orcid":false,"given":"Rick S.","family":"Blum","sequence":"additional","affiliation":[{"name":"Lehigh University, Bethlehem, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7455-2025","authenticated-orcid":false,"given":"Martin","family":"Takac","sequence":"additional","affiliation":[{"name":"Mohamed bin Zayed University of Artificial Intelligence, Abu Dhabi, UAE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9564-3812","authenticated-orcid":false,"given":"Brian M.","family":"Sadler","sequence":"additional","affiliation":[{"name":"Army Research Laboratory, Adelphi, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCWorkshops50388.2021.9473537"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2021.3089431"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2019.2902493"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1515\/9781400831470"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2219061"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/984622.984626"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2017.2703642"},{"key":"ref9","article-title":"Deep gradient compression: Reducing the communication bandwidth for distributed training","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Lin","year":"2018"},{"key":"ref10","article-title":"Federated learning: Strategies for improving communication efficiency","volume-title":"Proc. NIPS Workshop Private Multi-Party Mach. Learn.","author":"Konen","year":"2016"},{"key":"ref11","first-page":"5330","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Lian","year":"2017"},{"key":"ref12","first-page":"5973","article-title":"The convergence of sparsified gradient methods","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2018"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139042918"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19328-6_1"},{"key":"ref15","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Artif. Intell. Statist. PMLR","author":"McMahan","year":"2017"},{"key":"ref16","first-page":"4424","article-title":"Federated multi-task learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Smith","year":"2017"},{"article-title":"A berkeley view of systems challenges for AI","year":"2017","author":"Stoica","key":"ref17"},{"key":"ref18","first-page":"2613","article-title":"Sarah: A novel method for machine learning problems using stochastic recursive gradient","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Nguyen","year":"2017"},{"key":"ref19","first-page":"2663","article-title":"A stochastic gradient method with an exponential convergence _rate for finite training sets","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Roux","year":"2012"},{"key":"ref20","first-page":"1646","article-title":"Saga: A fast incremental gradient method with support for non-strongly convex composite objectives","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Defazio","year":"2014"},{"key":"ref21","first-page":"315","article-title":"Accelerating stochastic gradient descent using predictive variance reduction","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Johnson","year":"2013"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1137\/140961791"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2907258"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/9781601984616"},{"article-title":"Communication-efficient admm-based federated learning","year":"2021","author":"Zhou","key":"ref25"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"article-title":"On the utility of gradient compression in distributed training systems","year":"2021","author":"Agarwal","key":"ref27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2884998"},{"key":"ref30","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2022.2117355"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2020.3026398"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D17-1045"},{"key":"ref35","first-page":"4447","article-title":"Sparsified SGD with memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Stich","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/110837681"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.871582"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.13001\/1081-3810.3218"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1137\/1035134"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5793"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2015-354"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00060"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2985917"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/7.489500"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2005.843536"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2006.880254"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/SSP.2003.1289329"},{"key":"ref48","first-page":"5050","article-title":"LAGC: Lazily aggregated gradient for communication-efficient distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen","year":"2018"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref50","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","volume":"1","author":"Bonawitz","year":"2019"},{"article-title":"Horovod: Fast and easy distributed deep learning in tensorflow","year":"2018","author":"Sergeev","key":"ref51"},{"key":"ref52","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1025-2","volume-title":"The Mathematics of Nonlinear Programming","author":"Peressini","year":"1988"},{"volume-title":"Introductory Lectures on Convex Optimization: A Basic Course","year":"2013","author":"Nesterov","key":"ref53"},{"key":"ref54","first-page":"4897","article-title":"Lyapunov functions for first-order methods: Tight automated convergence guarantees","volume-title":"Proc. Int. Conf. Mach. Learn. Projection-Method Learn. Rule","author":"Taylor","year":"2018"},{"article-title":"Run-length encoding decompression","year":"2020","author":"Brooks","key":"ref55"},{"key":"ref56","first-page":"2021","article-title":"FedPAQ: A communication-efficient federated learning method with periodic averaging and quantization","volume-title":"Proc. Int. Conf. Artif. Intell. Statist., Projection-Method Learn. Rule","author":"Reisizadeh","year":"2020"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-016-1030-6"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611976236.23"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/5.726791"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"ref61","first-page":"361","article-title":"RCV1: A new benchmark collection for text categorization research","volume":"5","author":"Lewis","year":"2004","journal-title":"J. Mach. Learn. Res."},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2944169"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-41589-5_4"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4200690\/9776585\/9748078-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/4200690\/9776585\/09748078.pdf?arnumber=9748078","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,18]],"date-time":"2024-01-18T00:17:42Z","timestamp":1705537062000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9748078\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4]]},"references-count":63,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2022.3162989","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"type":"print","value":"1932-4553"},{"type":"electronic","value":"1941-0484"}],"subject":[],"published":{"date-parts":[[2022,4]]}}}