{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T05:12:27Z","timestamp":1772255547577,"version":"3.50.1"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,1]],"date-time":"2024-04-01T00:00:00Z","timestamp":1711929600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"French Government through the 3IA C\u00f4te d\u2019Azur Investments in the Future Project managed by the National Research Agency","award":["ANR-19-P3IA-0002"],"award-info":[{"award-number":["ANR-19-P3IA-0002"]}]},{"name":"Groupe La Poste, sponsor of the Inria Foundation, in the framework of the FedMalin Inria Challenge"},{"name":"European Network of Excellence dAIEDGE","award":["101120726"],"award-info":[{"award-number":["101120726"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE\/ACM Trans. Networking"],"published-print":{"date-parts":[[2024,4]]},"DOI":"10.1109\/tnet.2023.3324257","type":"journal-article","created":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T18:39:46Z","timestamp":1698086386000},"page":"1451-1460","source":"Crossref","is-referenced-by-count":10,"title":["Federated Learning Under Heterogeneous and Correlated Client Availability"],"prefix":"10.1109","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8395-4536","authenticated-orcid":false,"given":"Angelo","family":"Rodio","sequence":"first","affiliation":[{"name":"Inria, Centre Inria d&#x2019;Universit&#x00E9; C&#x00F4;te d&#x2019;Azur, Sophia-Antipolis, Valbonne, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3075-313X","authenticated-orcid":false,"given":"Francescomaria","family":"Faticanti","sequence":"additional","affiliation":[{"name":"Inria, Centre Inria d&#x2019;Universit&#x00E9; C&#x00F4;te d&#x2019;Azur, Sophia-Antipolis, Valbonne, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0542-8925","authenticated-orcid":false,"given":"Othmane","family":"Marfoq","sequence":"additional","affiliation":[{"name":"Centre Inria d&#x2019;Universit&#x00E9; C&#x00F4;te d&#x2019;Azur, Sophia-Antipolis, Valbonne, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8779-0620","authenticated-orcid":false,"given":"Giovanni","family":"Neglia","sequence":"additional","affiliation":[{"name":"Inria, Centre Inria d&#x2019;Universit&#x00E9; C&#x00F4;te d&#x2019;Azur, Sophia-Antipolis, Valbonne, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3070-4274","authenticated-orcid":false,"given":"Emilio","family":"Leonardi","sequence":"additional","affiliation":[{"name":"DET, Politecnico di Torino, Turin, Italy"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM53939.2023.10228876"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3377454"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8486403"},{"key":"ref4","first-page":"1","article-title":"Federated learning: Strategies for improving communication efficiency","volume-title":"Proc. NIPS Workshop Private Multi-Party Mach. Learn.","author":"Konecn\u00fd"},{"key":"ref5","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist","author":"McMahan"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref8","first-page":"1764","article-title":"Semi-cyclic stochastic gradient descent","volume-title":"Proc. 36th Int. Conf. Mach. Learn. (ICML)","author":"Eichner"},{"key":"ref9","article-title":"A field guide to federated optimization","author":"Wang","year":"2021","journal-title":"arXiv:2107.06917"},{"key":"ref10","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","volume":"1","author":"Bonawitz"},{"key":"ref11","article-title":"Distributed optimization over block-cyclic data","author":"Ding","year":"2020","journal-title":"arXiv:2002.07454"},{"key":"ref12","first-page":"1","article-title":"Diurnal or nocturnal? Federated learning from periodically shifting distributions","volume-title":"Proc. NeurIPS Workshop Distrib. Shifts, Connecting Methods Appl.","author":"Zhu"},{"key":"ref13","article-title":"Local stochastic approximation: A unified view of federated learning and distributed multi-task reinforcement learning algorithms","author":"Doan","year":"2020","journal-title":"arXiv:2006.13460"},{"key":"ref14","article-title":"Convergence rates of accelerated Markov gradient descent with applications in reinforcement learning","author":"Doan","year":"2020","journal-title":"arXiv:2002.02873"},{"key":"ref15","first-page":"1","article-title":"On Markov chain gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"31","author":"Sun"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/s0079-7421(08)60536-8"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1611835114"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR52688.2022.00986"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3224590"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2022.3168969"},{"key":"ref21","article-title":"On first-order meta-learning algorithms","author":"Nichol","year":"2018","journal-title":"arXiv:1803.02999"},{"key":"ref22","first-page":"1","article-title":"Adaptive federated optimization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Reddi"},{"key":"ref23","first-page":"1","article-title":"On the convergence of FedAvg on non-iid data","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Li"},{"key":"ref24","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Li"},{"key":"ref25","first-page":"1","article-title":"Optimal client sampling for federated learning","volume-title":"Proc. Trans. Mach. Learn. Res.","author":"Chen"},{"key":"ref26","first-page":"3407","article-title":"Clustered sampling: Low-variance and improved representativity for clients selection in federated learning","volume-title":"Proc. 38th Int. Conf. Mach. Learn. (ICML)","author":"Fraboni"},{"key":"ref27","first-page":"10351","article-title":"Towards understanding biased client selection in federated learning","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Statist.","author":"Cho"},{"key":"ref28","article-title":"Finite-time analysis of stochastic gradient descent under Markov randomness","author":"Doan","year":"2020","journal-title":"arXiv:2003.10973"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2021.3093035"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1016\/S0246-0203(97)80103-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1090\/mbk\/107"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/16M1080173"},{"key":"ref33","first-page":"7611","article-title":"Tackling the objective inconsistency problem in heterogeneous federated optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NIPS)","volume":"33","author":"Wang"},{"key":"ref34","article-title":"An empirical investigation of catastrophic forgetting in gradient-based neural networks","author":"Goodfellow","year":"2013","journal-title":"arXiv:1312.6211"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11651"},{"key":"ref36","article-title":"LEAF: A benchmark for federated settings","author":"Caldas","year":"2018","journal-title":"arXiv:1812.01097"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2012.2211477"},{"key":"ref38","volume-title":"Learning multiple layers of features from tiny images","author":"Krizhevsky","year":"2009"},{"key":"ref39","first-page":"1","article-title":"Federated learning with matched averaging","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Wang"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719512"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-96896-0"}],"container-title":["IEEE\/ACM Transactions on Networking"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/90\/10505042\/10292582.pdf?arnumber=10292582","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,19]],"date-time":"2024-04-19T17:36:24Z","timestamp":1713548184000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10292582\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4]]},"references-count":42,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tnet.2023.3324257","relation":{},"ISSN":["1063-6692","1558-2566"],"issn-type":[{"value":"1063-6692","type":"print"},{"value":"1558-2566","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4]]}}}