{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T21:26:22Z","timestamp":1770240382993,"version":"3.49.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T00:00:00Z","timestamp":1769904000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2026,2]]},"DOI":"10.1109\/tai.2025.3585090","type":"journal-article","created":{"date-parts":[[2025,7,1]],"date-time":"2025-07-01T13:43:57Z","timestamp":1751377437000},"page":"906-917","source":"Crossref","is-referenced-by-count":0,"title":["Refined Two-Sided Learning Rate Tuning for Robust Evaluation in Federated Learning"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1887-9060","authenticated-orcid":false,"given":"Erich","family":"Malan","sequence":"first","affiliation":[{"name":"Department of Control and Computer Engineering, Politecnico di Torino, Turin, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0527-8602","authenticated-orcid":false,"given":"Valentino","family":"Peluso","sequence":"additional","affiliation":[{"name":"Department of Control and Computer Engineering, Politecnico di Torino, Turin, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5881-3811","authenticated-orcid":false,"given":"Andrea","family":"Calimera","sequence":"additional","affiliation":[{"name":"Department of Control and Computer Engineering, Politecnico di Torino, Turin, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9046-5618","authenticated-orcid":false,"given":"Enrico","family":"Macii","sequence":"additional","affiliation":[{"name":"Interuniversity Department of Regional and Urban Studies and Planning, Politecnico di Torino, Turin, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","article-title":"Federated Learning Priorities under the European union artificial intelligence act","author":"Woisetschl\u00e4ger","year":"2024"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2021.108693"},{"key":"ref3","article-title":"Federated learning for emoji prediction in a mobile keyboard","author":"Ramaswamy","year":"2019"},{"key":"ref4","article-title":"Federated learning for mobile keyboard prediction","author":"Hard","year":"2018"},{"key":"ref5","article-title":"A field guide to federated optimization","author":"Wang","year":"2021"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2023.3297090"},{"key":"ref7","article-title":"Measuring the effects of non-identical data distribution for federated visual classification","author":"Hsu","year":"2019"},{"key":"ref8","article-title":"Adaptive federated optimization","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Reddi","year":"2021"},{"key":"ref9","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst. (MLSys)","author":"Li","year":"2020"},{"key":"ref10","first-page":"5132","article-title":"SCAFFOLD: stochastic controlled averaging for federated learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Karimireddy","year":"2020"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE53745.2022.00077"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TAI.2023.3293068"},{"key":"ref13","article-title":"Achieving linear speedup with partial worker participation in non-IID federated learning","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Yang","year":"2021"},{"key":"ref14","first-page":"22802","article-title":"Communication-efficient adaptive federated learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Wang","year":"2022"},{"issue":"2","key":"ref15","first-page":"1","article-title":"Leveraging function space aggregation for federated learning at scale","volume":"2024","author":"Dhawan","year":"2024","journal-title":"Trans. Mach. Learn. Res"},{"issue":"3","key":"ref16","first-page":"1","article-title":"Maximizing global model appeal in federated learning","volume":"2024","author":"Cho","year":"2024","journal-title":"Trans. Mach. Learn. Res."},{"issue":"10","key":"ref17","first-page":"1","article-title":"Gradient masked averaging for federated learning","volume":"2023","author":"Tenison","year":"2023","journal-title":"Trans. Mach. Learn. Res."},{"key":"ref18","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst. (MLSys)","author":"Bonawitz","year":"2019"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2023.3253813"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3555776.3577847"},{"key":"ref21","first-page":"35\u2009908","article-title":"FedHPO-Bench: A benchmark suite for federated hyperparameter optimization","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Wang","year":"2023"},{"key":"ref22","article-title":"Adam: A method for stochastic optimization","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Kingma","year":"2015"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2023.3300886"},{"key":"ref24","article-title":"On the convergence of fedavg on non-iid data","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Li","year":"2020"},{"key":"ref25","article-title":"Federated learning based on dynamic regularization","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Acar","year":"2021"},{"key":"ref26","article-title":"Fedexp: Speeding up federated averaging via extrapolation","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Jhunjhunwala","year":"2023"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN52387.2021.9533708"},{"key":"ref28","article-title":"FedHyper: A universal and robust learning rate scheduler for federated learning with hypergradient descent","author":"Wang","year":"2024"},{"key":"ref29","article-title":"Budgeted training: Rethinking deep neural network training under resource constraints","volume-title":"Proc. Int. Conf. Learn. Represent. (ICLR)","author":"Li","year":"2020"},{"key":"ref30","first-page":"64","article-title":"REX: revisiting budgeted training with an improved schedule","volume-title":"Proc. Mach. Learn. Syst. (MLSys)","author":"Chen","year":"2022"},{"key":"ref31","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. Int. Conf. Artif. Intell. Stat. (AISTATS)","author":"McMahan","year":"2017"},{"key":"ref32","article-title":"Learning Multiple Layers of Features from Tiny Images","author":"Krizhevsky","year":"2009"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/BigCom53800.2021.00018"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref35","first-page":"4387","article-title":"The non-IID data quagmire of decentralized machine learning","volume-title":"Proc. Int. Conf. Mach. Learn. (ICML)","author":"Hsieh","year":"2020"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.21236\/ADA273556"},{"key":"ref37","article-title":"Recurrent neural network regularization","author":"Zaremba","year":"2014"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3090331"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2024.3361458"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/9078688\/11370309\/11060918.pdf?arnumber=11060918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T05:52:50Z","timestamp":1770097970000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11060918\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2]]},"references-count":39,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tai.2025.3585090","relation":{},"ISSN":["2691-4581"],"issn-type":[{"value":"2691-4581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2]]}}}