{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T05:53:34Z","timestamp":1768974814187,"version":"3.49.0"},"reference-count":37,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2148224"],"award-info":[{"award-number":["2148224"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"OUSD R&E","award":["NIST"],"award-info":[{"award-number":["NIST"]}]},{"name":"industry partners as specified in the Resilient & Intelligent NextG Systems (RINGS) Program"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE J. Sel. Top. Signal Process."],"published-print":{"date-parts":[[2025,1]]},"DOI":"10.1109\/jstsp.2024.3430118","type":"journal-article","created":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T17:20:58Z","timestamp":1721236858000},"page":"60-73","source":"Crossref","is-referenced-by-count":2,"title":["Federated Learning at Scale: Addressing Client Intermittency and Resource Constraints"],"prefix":"10.1109","volume":"19","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9634-0880","authenticated-orcid":false,"given":"M\u00f3nica","family":"Ribero","sequence":"first","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7945-4114","authenticated-orcid":false,"given":"Haris","family":"Vikalo","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1498-494X","authenticated-orcid":false,"given":"Gustavo","family":"de Veciana","sequence":"additional","affiliation":[{"name":"Department of Electrical and Computer Engineering, University of Texas at Austin, Austin, TX, USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref3","article-title":"Federated evaluation and tuning for on-device personalization: System design & applications","author":"Paulik","year":"2022"},{"key":"ref4","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref5","article-title":"Applied federated learning: Architectural design for robust and efficient learning in privacy aware settings","author":"Stojkovic","year":"2022"},{"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.","author":"McMahan","year":"2017"},{"key":"ref7","article-title":"Adaptive federated optimization","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Reddi","year":"2021"},{"key":"ref8","first-page":"5132","article-title":"SCAFFOLD: Stochastic controlled averaging for federated learning","volume-title":"Proc. Int. Conf. Mach. Learning.","author":"Karimireddy","year":"2020"},{"key":"ref9","article-title":"On the convergence of fedAvg on non-IID data","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Li","year":"2020"},{"key":"ref10","first-page":"629","article-title":"Gaia: Geo-distributed machine learning approaching LAN speeds","volume-title":"Proc. 14th USENIX Symp. Networked Syst. Des. Implementation","author":"Hsieh","year":"2017"},{"key":"ref11","first-page":"5050","article-title":"LAG: Lazily aggregated gradient for communication-efficient distributed learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chen","year":"2018"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2022.3145576"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.patcog.2023.110122"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9413655"},{"key":"ref15","article-title":"Client selection in federated learning: Convergence analysis and power-of-choice selection strategies","author":"Cho","year":"2020"},{"key":"ref16","first-page":"1764","article-title":"Semi-cyclic stochastic gradient descent","volume-title":"Proc. Int. Conf. Mach. Learning.","author":"Eichner","year":"2019"},{"key":"ref17","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","volume":"2","author":"Li","year":"2020"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2021.3081746"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JSTSP.2022.3224590"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378161"},{"key":"ref22","first-page":"3581","article-title":"Federated learning with buffered asynchronous aggregation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Nguyen","year":"2022"},{"key":"ref23","first-page":"3407","article-title":"Clustered sampling: Low-variance and improved representativity for clients selection in federated learning","volume-title":"Proc. Int. Conf. Mach. Learning.","author":"Fraboni","year":"2021"},{"key":"ref24","first-page":"1126","article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Finn","year":"2017"},{"key":"ref25","first-page":"9120","article-title":"Which tasks should be learned together in multi-task learning?","volume-title":"Proc. Int. Conf. Mach. Learning.","author":"Standley","year":"2020"},{"key":"ref26","first-page":"27503","article-title":"Efficiently identifying task groupings for multi-task learning","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"34","author":"Fifty","year":"2021"},{"key":"ref27","first-page":"19586","article-title":"An efficient framework for clustered federated learning","volume-title":"Adv. Neural Inf. Process. Syst.","volume":"33","author":"Ghosh","year":"2020"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2020.3015958"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-022-01046-x"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2307\/1913641"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/IEEECONF44664.2019.9049066"},{"key":"ref32","article-title":"Achieving linear speedup with partial worker participation in non-IID federated learning","volume-title":"Proc. Int. Conf. Learn. Representations","author":"Yang","year":"2021"},{"key":"ref33","first-page":"1000","article-title":"Communication-efficient distributed optimization using an approximate newton-type method","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Shamir","year":"2014"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/3209669"},{"key":"ref35","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","volume":"1","author":"Bonawitz","year":"2019"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2014.2332731"},{"key":"ref37","first-page":"1109","article-title":"Optimal online estimation of the size of a dynamic multicast group","volume-title":"Proc. 21st Annu. Joint Conf. IEEE Comput. Commun. Societies","author":"Alouf","year":"2002"}],"container-title":["IEEE Journal of Selected Topics in Signal Processing"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/4200690\/10906680\/10601165-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/4200690\/10906680\/10601165.pdf?arnumber=10601165","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T17:42:48Z","timestamp":1749750168000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10601165\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1]]},"references-count":37,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/jstsp.2024.3430118","relation":{},"ISSN":["1932-4553","1941-0484"],"issn-type":[{"value":"1932-4553","type":"print"},{"value":"1941-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,1]]}}}