{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T22:36:13Z","timestamp":1769207773350,"version":"3.49.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"DARPA","doi-asserted-by":"publisher","award":["HR00112220025"],"award-info":[{"award-number":["HR00112220025"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2023]]},"DOI":"10.1109\/access.2023.3284891","type":"journal-article","created":{"date-parts":[[2023,6,9]],"date-time":"2023-06-09T17:26:53Z","timestamp":1686331613000},"page":"61173-61191","source":"Crossref","is-referenced-by-count":4,"title":["Communication-Efficient Zeroth-Order Distributed Online Optimization: Algorithm, Theory, and Applications"],"prefix":"10.1109","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0009-0008-4730-0154","authenticated-orcid":false,"given":"Ege C.","family":"Kaya","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-6738-8855","authenticated-orcid":false,"given":"Mehmet Berk","family":"Sahin","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8421-4270","authenticated-orcid":false,"given":"Abolfazl","family":"Hashemi","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP49357.2023.10096148"},{"key":"ref57","article-title":"Can decentralized algorithms outperform centralized algorithms? A case study for decentralized parallel stochastic gradient descent","author":"lian","year":"2017","journal-title":"arXiv 1705 09056"},{"key":"ref12","article-title":"On the convergence of decentralized gradient descent","author":"yuan","year":"2013","journal-title":"arXiv 1310 7063"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2020.3003156"},{"key":"ref15","article-title":"Federated learning with non-IID data","author":"zhao","year":"2018","journal-title":"arXiv 1806 00582"},{"key":"ref59","article-title":"On the unreasonable effectiveness of federated averaging with heterogeneous data","author":"wang","year":"2022","journal-title":"arXiv 2206 04723"},{"key":"ref14","article-title":"Preserving privacy and security in federated learning","author":"nguyen","year":"2022","journal-title":"arXiv 2202 03402"},{"key":"ref58","article-title":"Stochastic gradient push for distributed deep learning","author":"assran","year":"2018","journal-title":"arXiv 1811 10792"},{"key":"ref53","article-title":"Tackling the objective inconsistency problem in heterogeneous federated optimization","volume":"33","author":"wang","year":"2020","journal-title":"Proc Adv Neural Inf Process Syst (NeurIPS)"},{"key":"ref52","article-title":"A unified theory of decentralized SGD with changing topology and local updates","author":"koloskova","year":"2020","journal-title":"arXiv 2003 10422"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2019.2921593"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39568-1"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2932049"},{"key":"ref54","article-title":"SlowMo: Improving communication-efficient distributed SGD with slow momentum","author":"wang","year":"2019","journal-title":"arXiv 1910 00643"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2021.3133372"},{"key":"ref16","article-title":"Asynchronous federated optimization","author":"xie","year":"2019","journal-title":"arXiv 1903 03934"},{"key":"ref19","article-title":"Adaptive federated optimization","author":"reddi","year":"2020","journal-title":"arXiv 2003 00295"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9415052"},{"key":"ref51","article-title":"Tighter theory for local SGD on identical and heterogeneous data","author":"khaled","year":"2019","journal-title":"arXiv 1909 04746"},{"key":"ref50","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","author":"karimireddy","year":"2019","journal-title":"arXiv 1910 06378"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/LSENS.2021.3058119"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2018.2824849"},{"key":"ref48","article-title":"Communication-efficient distributed blockwise momentum SGD with error-feedback","author":"zheng","year":"2019","journal-title":"arXiv 1905 10936"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2914669"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2020.3023733"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2016.2593899"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/TAES.2019.2930017"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3146976"},{"key":"ref49","article-title":"On the linear speedup analysis of communication efficient momentum SGD for distributed non-convex optimization","author":"yu","year":"2019","journal-title":"arXiv 1905 03817"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/ijoo.2022.0085"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2008.924138"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.robot.2006.08.004"},{"key":"ref4","article-title":"Decentralized stochastic optimization and gossip algorithms with compressed communication","author":"koloskova","year":"2019","journal-title":"arXiv 1902 00340"},{"key":"ref3","article-title":"QSGD: Communication-efficient SGD via gradient quantization and encoding","author":"alistarh","year":"2016","journal-title":"arXiv 1610 02132"},{"key":"ref6","article-title":"Error feedback fixes SignSGD and other gradient compression schemes","author":"karimireddy","year":"2019","journal-title":"arXiv 1901 09847"},{"key":"ref5","article-title":"Sparsified SGD with memory","author":"stich","year":"2018","journal-title":"arXiv 1809 07599"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029248"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377524"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1177\/1059712316664120"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/CDC42340.2020.9304272"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1137\/21M1405551"},{"key":"ref31","article-title":"Safe, multi-agent, reinforcement learning for autonomous driving","author":"shalev-shwartz","year":"2016","journal-title":"arXiv 1610 03295"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/ICRA.2018.8461233"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i10.17062"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/j.trc.2020.102662"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2810103.2813687"},{"key":"ref1","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"mcmahan","year":"2016","journal-title":"arXiv 1602 05629"},{"key":"ref39","article-title":"Introduction to online convex optimization","author":"hazan","year":"2019","journal-title":"arXiv 1909 05207"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2019.2914025"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3138977"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/WCSP52459.2021.9613620"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2839563"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TSG.2016.2539948"},{"key":"ref20","article-title":"Communication-efficient distributed learning via lazily aggregated quantized gradients","author":"sun","year":"2019","journal-title":"arXiv 1909 07588"},{"key":"ref64","article-title":"SGD: General analysis and improved rates","author":"gower","year":"2019","journal-title":"arXiv 1901 09401"},{"key":"ref63","year":"2022","journal-title":"Supplementary Material"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3214122"},{"key":"ref21","first-page":"496","article-title":"Faster non-convex federated learning via global and local momentum","author":"das","year":"2022","journal-title":"Proc Uncertainty Artif Intell"},{"key":"ref65","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-030-39568-1","author":"lan","year":"2020","journal-title":"First-Order and Stochastic Optimization Methods for Machine Learning"},{"key":"ref28","first-page":"497","author":"nocedal","year":"2006","journal-title":"Penalty and Augmented Lagrangian Methods"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10208-015-9296-2"},{"key":"ref29","article-title":"A single-loop gradient descent and perturbed ascent algorithm for nonconvex functional constrained optimization","author":"lu","year":"2022","journal-title":"arXiv 2207 05650"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2015.2409256"},{"key":"ref62","first-page":"11145","article-title":"Robust training in high dimensions via block coordinate geometric median descent","author":"acharya","year":"2022","journal-title":"Proc Int Conf Artif Intell Statist"},{"key":"ref61","first-page":"1195","article-title":"Fast and faster convergence of SGD for over-parameterized models and an accelerated perceptron","author":"vaswani","year":"2019","journal-title":"Proc 22nd Int Conf Artif Intell Statist"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10005208\/10147304.pdf?arnumber=10147304","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T19:42:29Z","timestamp":1689018149000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10147304\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/access.2023.3284891","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]}}}