{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:15:55Z","timestamp":1774120555574,"version":"3.50.1"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Government of Israel\u2014Israeli Ministry of Defense, Mission to the USA"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Signal Process."],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/tsp.2024.3356257","type":"journal-article","created":{"date-parts":[[2024,1,19]],"date-time":"2024-01-19T18:54:45Z","timestamp":1705690485000},"page":"735-743","source":"Crossref","is-referenced-by-count":10,"title":["A Communication-Efficient Adaptive Algorithm for Federated Learning Under Cumulative Regret"],"prefix":"10.1109","volume":"72","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1361-4565","authenticated-orcid":false,"given":"Sudeep","family":"Salgia","sequence":"first","affiliation":[{"name":"School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-7964-011X","authenticated-orcid":false,"given":"Tamir","family":"Gabay","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9590-4285","authenticated-orcid":false,"given":"Qing","family":"Zhao","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0532-009X","authenticated-orcid":false,"given":"Kobi","family":"Cohen","sequence":"additional","affiliation":[{"name":"School of Electrical and Computer Engineering, Ben-Gurion University of the Negev, Beer Sheva, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177729586"},{"key":"ref2","volume-title":"Introduction to Optimization","author":"Polyak","year":"1987"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1561\/9781680831719"},{"key":"ref5","first-page":"165","article-title":"Optimal distributed online prediction using mini-batches","volume":"13","author":"Dekel","year":"2012","journal-title":"J. Mach. Learn. Res."},{"key":"ref6","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"McMahan","year":"2017"},{"issue":"122","key":"ref7","first-page":"1","article-title":"Distributed stochastic variance reduced gradient methods by sampling extra data with replacement","volume":"18","author":"Lee","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","article-title":"On the convergence of FedAvg on non-IID data","volume-title":"Proc. 8th Int. Conf. Learn. Represent.","author":"Li","year":"2019"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3198176"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.3005291"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3404397.3404457"},{"key":"ref12","first-page":"7057","article-title":"FedSplit: An algorithmic framework for fast federated optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"2020","author":"Pathak","year":"2020"},{"key":"ref13","article-title":"Adaptive federated optimization","volume-title":"Proc. 9th Int. Conf. Learn. Represent.","author":"Reddi","year":"2020"},{"key":"ref14","first-page":"10265","article-title":"Is local SGD better than minibatch SGD?","volume-title":"Proc. 37th Int. Conf. Mach. Learn., ICML","author":"Woodworth","year":"2020"},{"key":"ref15","first-page":"6281","article-title":"Minibatch vs local SGD for heterogeneous distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Woodworth","year":"2020"},{"key":"ref16","article-title":"MIME: Mimicking centralized stochastic algorithms in federated learning","author":"Karimireddy","year":"2020"},{"key":"ref17","first-page":"5088","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","volume-title":"Proc. 37th Int. Conf. Mach. Learn. (ICML)","volume":"PartF16814","author":"Karimireddy","year":"2020"},{"key":"ref18","first-page":"674","article-title":"Exploring fast and communication-efficient algorithms in large-scale distributed networks","volume-title":"Proc. 22nd Int. Conf. Artif. Intell. Statist. (AISTATS)","author":"Yu","year":"2020"},{"key":"ref19","first-page":"1","article-title":"Cooperative SGD: A unified framework for the design and analysis of local-update SGD algorithms","volume":"22","author":"Wang","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref20","first-page":"4285","article-title":"SoteriaFL: A unified framework for private federated learning with communication compression","volume-title":"Proc. 36th Annu. Conf. Neural Inf. Process. Syst.","volume":"35","author":"Li","year":"2022"},{"key":"ref21","first-page":"496","article-title":"Faster non-convex federated learning via global and local momentum","volume-title":"Proc. 38th Conf. Uncertainty Artif. Intell. (UAI)","author":"Das","year":"2022"},{"key":"ref22","first-page":"31653","article-title":"BEER: Fast $O(1\/T)$ rate for decentralized nonconvex optimization with communication compression","author":"Zhao","year":"2022"},{"key":"ref23","article-title":"Federated online and bandit convex optimization","volume-title":"Proc. 40th Int. Conf. Mach. Learn.(ICML)","author":"Patel","year":"2023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-022-04065-3"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/CDC45484.2021.9683589"},{"key":"ref26","first-page":"2089","article-title":"Real time kernel learning for sensor networks using principles of federated learning","volume-title":"Proc. Asia-Pacific Signal Inf. Process. Assoc. Annu. Summit Conf. (APSIPA ASC)","author":"Kuh","year":"2021"},{"key":"ref27","article-title":"Local SGD converges fast and communicates little","volume-title":"Proc. 7th Int. Conf. Learn. Represent. (ICLR)","author":"Stich","year":"2019"},{"key":"ref28","first-page":"4519","article-title":"Tighter theory for local SGD on identical and heterogeneous data","author":"Khaled","year":"2019"},{"key":"ref29","article-title":"Local SGD with periodic averaging: Tighter analysis and adaptive synchronization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Haddadpour","year":"2019"},{"key":"ref30","first-page":"12431","article-title":"On the linear speedup analysis of communication efficient momentum SGD for distributed non-convex optimization","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","volume":"2019","author":"Yu","year":"2019"},{"key":"ref31","article-title":"Local SGD with a communication overhead depending only on the number of workers","author":"Spiridonoff","year":"2020"},{"key":"ref32","first-page":"2350","article-title":"Federated learning with compression: Unified analysis and sharp guarantees","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Haddadpour","year":"2021"},{"key":"ref33","first-page":"15750","article-title":"ProxSkip: Yes! Local gradient steps provably lead to communication acceleration! Finally!","volume-title":"Proc. 39th Int. Conf. Mach. Learn.","author":"Mishchenko","year":"2022"},{"key":"ref34","article-title":"Federated learning: Strategies for improving communication efficiency","author":"Konecn\u00fd","year":"2016"},{"key":"ref35","first-page":"894","article-title":"signSGD: Compressed optimisation for non-convex problems","volume-title":"Proc. 35th Int. Conf. Mach. Learn. (ICML)","volume":"2","author":"Bernstein","year":"2018"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/jsait.2020.2985917"},{"key":"ref37","article-title":"Communication-efficient distributed learning via lazily aggregated quantized gradients","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Sun","year":"2019"},{"key":"ref38","article-title":"Hyper-sphere quantization: Communication-efficient SGD for federated learning","author":"Dai","year":"2019"},{"key":"ref39","first-page":"10747","article-title":"DoubleSqueeze: Parallel stochastic gradient descent with double-pass error-compensated compression","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","volume":"2019","author":"Tang","year":"2019"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5706"},{"key":"ref41","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.","author":"Reisizadeh","year":"2020"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2021.3073112"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3041388"},{"key":"ref44","first-page":"8852","article-title":"DAdaQuant: Doubly-adaptive quantization for communication-efficient federated learning","volume-title":"Proc. 39th Int. Conf. Mach. Learn., ser. Machine Learning Research","volume":"162","author":"H\u00f6nig","year":"2022"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413697"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/GCWkshps56602.2022.10008580"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2021.3126081"},{"key":"ref48","article-title":"Communication-efficient distributed deep learning: A comprehensive survey","author":"Tang","year":"2020"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.3390\/app12188980"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1016\/j.jfranklin.2022.12.053"},{"key":"ref51","first-page":"29845","article-title":"Distributed linear bandits under communication constraints","volume-title":"Proc. 40th Int. Conf. Mach. Learn. (ICML)","author":"Salgia","year":"2023"},{"key":"ref52","article-title":"A short note on concentration inequalities for random vectors with subgaussian norm","author":"Jin","year":"2019"}],"container-title":["IEEE Transactions on Signal Processing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/78\/10347386\/10410035.pdf?arnumber=10410035","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T02:54:16Z","timestamp":1707447256000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10410035\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/tsp.2024.3356257","relation":{},"ISSN":["1053-587X","1941-0476"],"issn-type":[{"value":"1053-587X","type":"print"},{"value":"1941-0476","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}