{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,20]],"date-time":"2026-08-20T15:49:04Z","timestamp":1787240944399,"version":"build-2736575974"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T00:00:00Z","timestamp":1746057600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62473098"],"award-info":[{"award-number":["62473098"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62172090"],"award-info":[{"award-number":["62172090"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Southeast University Interdisciplinary Research Program"},{"name":"Start-up Research Fund of Southeast University","award":["RF1028623097"],"award-info":[{"award-number":["RF1028623097"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1109\/tnse.2025.3540175","type":"journal-article","created":{"date-parts":[[2025,2,7]],"date-time":"2025-02-07T13:44:54Z","timestamp":1738935894000},"page":"1849-1858","source":"Crossref","is-referenced-by-count":1,"title":["A Linearly Convergent Quantized Stochastic Gradient Tracking Method With Variance Reduction"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-8587-1844","authenticated-orcid":false,"given":"Longkang","family":"Zhu","sequence":"first","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4443-608X","authenticated-orcid":false,"given":"Xinli","family":"Shi","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9450-1759","authenticated-orcid":false,"given":"Jie","family":"Gui","sequence":"additional","affiliation":[{"name":"School of Cyber Science and Engineering, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3133-7119","authenticated-orcid":false,"given":"Jinde","family":"Cao","sequence":"additional","affiliation":[{"name":"School of Mathematics, Southeast University, Nanjing, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mahmoud","family":"Abdel-Aty","sequence":"additional","affiliation":[{"name":"Deanship of Graduate Studies and Scientific Research, Ahlia University, Manama, Bahrain"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2012.2219061"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11432-020-3092-y"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2006.1657817"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.arcontrol.2019.05.006"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/14096668X"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2021.3122927"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-010-9737-7"},{"key":"ref12","first-page":"5331","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":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2012.2198470"},{"key":"ref14","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":"ref15","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":"ref16","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":"ref17","doi-asserted-by":"publisher","DOI":"10.3934\/jimo.2023018"},{"key":"ref18","article-title":"PMGT-VR: A decentralized proximal-gradient algorithmic framework with variance reduction","author":"Ye","year":"2020"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3170944"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3225229"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3031071"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1155\/WCN.2005.774"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1002\/dac.2417"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2017.2745201"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.1396"},{"key":"ref26","first-page":"1707","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Alistarh","year":"2017"},{"key":"ref27","first-page":"2021","article-title":"FedPAQ: A communication-efficient federated learning method with periodic averaging and quantization","volume-title":"Proc. Int. Conf. Artif. Statist.","author":"Reisizadeh","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3180695"},{"key":"ref29","first-page":"4087","article-title":"A linearly convergent algorithm for decentralized optimization: Sending less bits for free!","volume-title":"Proc. Int. Conf. Artif. Statist.","author":"Kovalev"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CDC49753.2023.10384180"},{"key":"ref31","article-title":"Convergence property of the quantized distributed gradient descent with constant stepsizes and an effective strategy for the stepsize selection","author":"Choi","year":"2023","journal-title":"Authorea Preprints"},{"key":"ref32","first-page":"31653","article-title":"Beer: Fast $ o (1\/t)$ rate for decentralized nonconvex optimization with communication compression","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhao","year":"2022"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2932876"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2014.2357513"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3219289"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2600597"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ACSSC.2018.8645345"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.3014095"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029541"},{"key":"ref40","first-page":"9324","article-title":"Quantized decentralized stochastic learning over directed graphs","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Taheri","year":"2020"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.10.066"},{"key":"ref42","first-page":"78","article-title":"A lower bound for the optimization of finite sums","volume-title":"Proc. 32nd Int. Conf. Mach. Learn.","author":"Agarwal","year":"2015"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1137\/060678324"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2972824"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"issue":"18","key":"ref48","first-page":"290","article-title":"On random graphs","volume":"6","author":"Erdos","year":"1958","journal-title":"Publicationes Math."}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6488902\/10975856\/10878438.pdf?arnumber=10878438","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T17:36:10Z","timestamp":1761672970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10878438\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5]]},"references-count":48,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2025.3540175","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5]]}}}