{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T16:22:24Z","timestamp":1775578944757,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100020785","name":"Shenzhen Research Institute of Big Data","doi-asserted-by":"publisher","award":["J00120190011"],"award-info":[{"award-number":["J00120190011"]}],"id":[{"id":"10.13039\/501100020785","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62003287"],"award-info":[{"award-number":["62003287"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Shenzhen Science and Technology Program","award":["RCYX20210609103229031"],"award-info":[{"award-number":["RCYX20210609103229031"]}]},{"name":"Shenzhen Science and Technology Program","award":["GXWD20201231105722002-20200901175001001"],"award-info":[{"award-number":["GXWD20201231105722002-20200901175001001"]}]},{"name":"Shenzhen Institute of Artificial Intelligence and Robotics for Society","award":["AC01202101108"],"award-info":[{"award-number":["AC01202101108"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Automat. Contr."],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1109\/tac.2022.3180695","type":"journal-article","created":{"date-parts":[[2022,6,7]],"date-time":"2022-06-07T19:37:05Z","timestamp":1654630625000},"page":"5622-5629","source":"Crossref","is-referenced-by-count":46,"title":["A Compressed Gradient Tracking Method for Decentralized Optimization With Linear Convergence"],"prefix":"10.1109","volume":"67","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8356-8405","authenticated-orcid":false,"given":"Yiwei","family":"Liao","sequence":"first","affiliation":[{"name":"School of Data Science, Chinese University of Hong Kong, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8097-0175","authenticated-orcid":false,"given":"Zhuorui","family":"Li","sequence":"additional","affiliation":[{"name":"Shenzhen Research Institute of Big Data, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9326-6670","authenticated-orcid":false,"given":"Kun","family":"Huang","sequence":"additional","affiliation":[{"name":"School of Data Science, Shenzhen Research Institute of Big Data, Chinese University of Hong Kong, Shenzhen, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5813-527X","authenticated-orcid":false,"given":"Shi","family":"Pu","sequence":"additional","affiliation":[{"name":"School of Data Science, Shenzhen Institute of Artificial Intelligence and Robotics for Society, Chinese University of Hong Kong, Shenzhen, China"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2626578"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-control-060117-105131"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975210"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1137\/14096668x"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7402509"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSIPN.2016.2524588"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1137\/16m1084316"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TCNS.2017.2698261"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2017.7963560"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-020-01487-0"},{"key":"ref12","first-page":"1662","article-title":"Communication-efficient distributed optimization in networks with gradient tracking and variance reduction","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Li","year":"2020"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2364096"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2018.2816104"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/19M1259973"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2012.6426375"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2018.2834316"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2972824"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/jproc.2020.3024266"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9303917"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.21437\/Interspeech.2014-274"},{"key":"ref22","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":"ref23","first-page":"559","article-title":"SIGNSGD: Compressed optimisation for non-convex problems","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Bernstein","year":"2018"},{"key":"ref24","first-page":"4452","article-title":"Sparsified SGD with memory","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Stich","year":"2018"},{"key":"ref25","first-page":"3252","article-title":"Error feedback fixes signSGD and other gradient compression schemes","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Karimireddy","year":"2019"},{"key":"ref26","article-title":"Distributed learning with compressed gradient differences","author":"Mishchenko","year":"2019"},{"key":"ref27","first-page":"6155","article-title":"DoubleSqueeze: Parallel stochastic gradient descent with double-pass error-compensated compression","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Tang","year":"2019"},{"key":"ref28","article-title":"On communication compression for distributed optimization on heterogeneous data","author":"Stich","year":"2020"},{"key":"ref29","article-title":"On biased compression for distributed learning","author":"Beznosikov","year":"2020"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS51616.2021.00060"},{"key":"ref31","first-page":"7652","article-title":"Communication compression for decentralized training","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tang","year":"2018"},{"key":"ref32","first-page":"3479","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Koloskova","year":"2019"},{"key":"ref33","article-title":"Decentralized deep learning with arbitrary communication compression","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Koloskova","year":"2020"},{"key":"ref34","article-title":"Linear convergent decentralized optimization with compression","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Liu","year":"2020"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2926022"},{"key":"ref36","first-page":"4087","article-title":"A linearly convergent algorithm for decentralized optimization: Sending less bits for free!","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Kovalev","year":"2021"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3176253"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2020.2989281"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2985917"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3180695"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139020411"}],"container-title":["IEEE Transactions on Automatic Control"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9\/9903918\/09789732.pdf?arnumber=9789732","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T03:00:11Z","timestamp":1706756411000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9789732\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":41,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tac.2022.3180695","relation":{},"ISSN":["0018-9286","1558-2523","2334-3303"],"issn-type":[{"value":"0018-9286","type":"print"},{"value":"1558-2523","type":"electronic"},{"value":"2334-3303","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,10]]}}}