{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T14:53:58Z","timestamp":1787237638740,"version":"build-2736575974"},"reference-count":58,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"INFOTECH Project NOOR"},{"name":"EU-CHISTERA projects LeadingEdge and CONNECT"},{"DOI":"10.13039\/501100002341","name":"Academy of Finland through the MISSION, CARMA, and SMARTER projects","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100002341","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Commun."],"published-print":{"date-parts":[[2021,1]]},"DOI":"10.1109\/tcomm.2020.3026398","type":"journal-article","created":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T20:24:06Z","timestamp":1600979046000},"page":"164-181","source":"Crossref","is-referenced-by-count":49,"title":["Q-GADMM: Quantized Group ADMM for Communication Efficient Decentralized Machine Learning"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5012-2370","authenticated-orcid":false,"given":"Anis","family":"Elgabli","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7623-6552","authenticated-orcid":false,"given":"Jihong","family":"Park","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit Singh","family":"Bedi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4481-8168","authenticated-orcid":false,"given":"Chaouki Ben","family":"Issaid","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0261-0171","authenticated-orcid":false,"given":"Mehdi","family":"Bennis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-4723","authenticated-orcid":false,"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426691"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1007\/s10915-016-0318-2"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2894803"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2017.2686368"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2367458"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2015.2461520"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2016.1278445"},{"key":"ref36","first-page":"3068","article-title":"Communication-efficient distributed dual coordinate ascent","volume":"27","author":"jaggi","year":"2014","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","article-title":"A dual algorithm for solution non linear variational problems via finite element approximation","volume":"127","author":"gabay","year":"1975"},{"key":"ref34","first-page":"41","article-title":"Sur l’approximation, par éléments finis d’ordre un, et la résolution, par pénalisation-dualité d’une classe de problèmes de Dirichlet non linéaires","volume":"9","author":"glowinski","year":"1975","journal-title":"ESAIM Math Modelling Numer Anal -Modélisation Mathématique et Analyse Numérique"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2298712"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref2","article-title":"Extreme URLLC: Vision, challenges, and key enablers","author":"park","year":"2020","journal-title":"arXiv 2001 09683"},{"key":"ref1","article-title":"Advances and open problems in federated learning","author":"kairouz","year":"2019","journal-title":"arXiv 1912 04977"},{"key":"ref20","article-title":"A joint learning and communications framework for federated learning over wireless networks","author":"chen","year":"2019","journal-title":"arXiv 1909 07972"},{"key":"ref22","article-title":"On the linear speedup analysis of communication efficient momentum SGD for distributed non-convex optimization","author":"yu","year":"2019","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2975189"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1561\/2200000016"},{"key":"ref23","first-page":"1","article-title":"GADMM: Fast and communication efficient framework for distributed machine learning","volume":"21","author":"elgabli","year":"2020","journal-title":"J Mach Learn Res"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054491"},{"key":"ref25","article-title":"Acceleration for compressed gradient descent in distributed and federated optimization","author":"li","year":"2020","journal-title":"arXiv 2002 11364"},{"key":"ref50","article-title":"Communication-efficient algorithms for decentralized optimization over directed graphs","author":"chen","year":"2020","journal-title":"arXiv 2005 13189"},{"key":"ref51","article-title":"SPARQ-SGD: Event-triggered and compressed communication in decentralized stochastic optimization","author":"singh","year":"2019","journal-title":"arXiv 1910 14280"},{"key":"ref58","author":"torgo","year":"2014","journal-title":"Regression DataSets"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref56","article-title":"Natural compression for distributed deep learning","author":"horvath","year":"2019","journal-title":"arXiv 1905 10988"},{"key":"ref55","article-title":"FedPAQ: A communication-efficient federated learning method with periodic averaging and quantization","author":"reisizadeh","year":"2019","journal-title":"arXiv 1909 13014"},{"key":"ref54","first-page":"1709","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2017","journal-title":"Proc Adv NIPS"},{"key":"ref53","first-page":"1509","article-title":"TernGrad: Ternary gradients to reduce communication in distributed deep learning","author":"wen","year":"2017","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154332"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref11","article-title":"SignSGD: Compressed optimisation for non-convex problems","author":"bernstein","year":"2018","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2907258"},{"key":"ref12","first-page":"3370","article-title":"Communication-efficient distributed learning via lazily aggregated quantized gradients","author":"sun","year":"2019","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref13","article-title":"Federated learning: Strategies for improving communication efficiency","author":"konecny","year":"2016","journal-title":"Proc NIPS Wksp PMPML"},{"key":"ref14","article-title":"Communication-efficient on-device machine learning: Federated distillation and augmentation under non-iid private data","author":"jeong","year":"0"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PIMRC.2019.8904164"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2904348"},{"key":"ref17","first-page":"5055","article-title":"LAG: Lazily aggregated gradient for communication-efficient distributed learning","author":"chen","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761315"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2944169"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/LWC.2020.2973624"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC48557.2020.9154304"},{"key":"ref6","article-title":"Distilling on-device intelligence at the network edge","author":"park","year":"2019","journal-title":"arXiv 1908 05895"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2019.2941458"},{"key":"ref8","article-title":"Multi-stage hybrid federated learning over large-scale wireless fog networks","author":"hosseinalipour","year":"2020","journal-title":"arXiv 2007 09511"},{"key":"ref7","article-title":"Communication-efficient and distributed learning over wireless networks: Principles and applications","author":"park","year":"2020","journal-title":"arXiv 2008 02608"},{"key":"ref49","first-page":"4447","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref9","article-title":"Federated learning: Collaborative machine learning without centralized training data","author":"mcmahan","year":"2017","journal-title":"Google Research Blog"},{"key":"ref46","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"Proc NIPS"},{"key":"ref45","doi-asserted-by":"crossref","first-page":"953","DOI":"10.1109\/JPROC.2018.2817461","article-title":"Network topology and communication-computation tradeoffs in decentralized optimization","volume":"106","author":"nedi?","year":"2018","journal-title":"Proc IEEE"},{"key":"ref48","article-title":"Adaptive serverless learning","author":"gao","year":"2020","journal-title":"arXiv 2008 10422"},{"key":"ref47","article-title":"Decentralized deep learning with arbitrary communication compression","author":"koloskova","year":"2019","journal-title":"arXiv 1907 09356"},{"key":"ref42","first-page":"3329","article-title":"Distributed mean estimation with limited communication","volume":"70","author":"suresh","year":"2017","journal-title":"Proc Int Conf Mach Learn (JMLR)"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2019.8849561"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0826-5"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP.2016.7472455"}],"container-title":["IEEE Transactions on Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/26\/9325108\/09205203.pdf?arnumber=9205203","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T14:48:51Z","timestamp":1652194131000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9205203\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1]]},"references-count":58,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tcomm.2020.3026398","relation":{},"ISSN":["0090-6778","1558-0857"],"issn-type":[{"value":"0090-6778","type":"print"},{"value":"1558-0857","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1]]}}}