{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:23:34Z","timestamp":1740169414560,"version":"3.37.3"},"reference-count":40,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"JSPS KAKENHI","award":["JP23K28139"],"award-info":[{"award-number":["JP23K28139"]}]},{"DOI":"10.13039\/501100012389","name":"Commissioned Research by the National Institute of Information and Communications Technology (NICT), Japan","doi-asserted-by":"publisher","award":["225"],"award-info":[{"award-number":["225"]}],"id":[{"id":"10.13039\/501100012389","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3521009","type":"journal-article","created":{"date-parts":[[2024,12,23]],"date-time":"2024-12-23T19:24:31Z","timestamp":1734981871000},"page":"195131-195144","source":"Crossref","is-referenced-by-count":0,"title":["Asynchronous Federated Learning Through Online Linear Regressions"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5709-4752","authenticated-orcid":false,"given":"Taiga","family":"Kashima","sequence":"first","affiliation":[{"name":"Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan"}]},{"given":"Ayako","family":"Amma","sequence":"additional","affiliation":[{"name":"Woven by Toyota Inc., Tokyo, Japan"}]},{"given":"Hideki","family":"Nakayama","sequence":"additional","affiliation":[{"name":"Graduate School of Information Science and Technology, The University of Tokyo, Tokyo, Japan"}]}],"member":"263","reference":[{"key":"ref1","first-page":"1273","article-title":"Communication-efficient learning of deep networks from decentralized data","volume-title":"Proc. 20th Int. Conf. Artif. Intell. Statist.","volume":"54","author":"McMahan"},{"key":"ref2","first-page":"374","article-title":"Towards federated learning at scale: System design","volume-title":"Proc. Mach. Learn. Syst.","author":"Bonawitz"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2975749"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.inffus.2022.09.011"},{"key":"ref5","first-page":"4615","article-title":"Agnostic federated learning","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Mohri"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2021.07.098"},{"key":"ref7","first-page":"2938","article-title":"How to backdoor federated learning","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Bagdasaryan"},{"key":"ref8","article-title":"Learning to detect malicious clients for robust federated learning","author":"Li","year":"2020","journal-title":"arXiv:2002.00211"},{"key":"ref9","article-title":"RoFL: Attestable robustness for secure federated learning","author":"Burkhalter","year":"2021","journal-title":"arXiv:2107.03311"},{"article-title":"Federated learning: Strategies for improving communication efficiency","volume-title":"Proc. NIPS Workshop Private Multi-Party Mach. Learn.","author":"Kone\u010dn\u00fd","key":"ref10"},{"key":"ref11","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"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2023.100595"},{"key":"ref13","article-title":"Asynchronous federated optimization","author":"Xie","year":"2019","journal-title":"arXiv:1903.03934"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3363884"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.21236\/AD0241531"},{"issue":"3","key":"ref16","first-page":"551","article-title":"Online passive aggressive algorithms","volume":"7","author":"Crammer","year":"2006","journal-title":"J. Mach. Learn. Res."},{"article-title":"The learning behind Gmail priority inbox","volume-title":"Proc. NIPS Workshop Learn. Cores, Clusters Clouds (LCCC)","author":"Aberdeen","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133982"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/PERCOM50583.2021.9439129"},{"key":"ref20","first-page":"11220","article-title":"Federated reconstruction: Partially local federated learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Singhal"},{"key":"ref21","first-page":"429","article-title":"Federated optimization in heterogeneous networks","volume-title":"Proc. Mach. Learn. Syst.","author":"Li"},{"article-title":"Adaptive federated optimization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Reddi","key":"ref22"},{"article-title":"HeteroFL: Computation and communication efficient federated learning for heterogeneous clients","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Diao","key":"ref23"},{"key":"ref24","first-page":"3557","article-title":"Personalized federated learning with theoretical guarantees: A model-agnostic meta-learning approach","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Fallah"},{"key":"ref25","first-page":"3973","article-title":"FedBoost: A communication-efficient algorithm for federated learning","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","volume":"1","author":"Hamer"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2019.00065"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9378161"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2019.2953131"},{"key":"ref29","first-page":"3581","article-title":"Federated learning with buffered asynchronous aggregation","volume-title":"Proc. Int. Conf. Artif. Intell. Statist.","author":"Nguyen"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC51858.2021.9593194"},{"article-title":"Very deep convolutional networks for large-scale image recognition","volume-title":"Proc. 3rd Int. Conf. Learn. Represent. (ICLR)","author":"Simonyan","key":"ref31"},{"volume-title":"Cos 511: Theoretical machine learning","year":"2013","author":"Schapire","key":"ref32"},{"article-title":"Learning multiple layers of features from tiny images","year":"2009","author":"Krizhevsky","key":"ref33"},{"key":"ref34","first-page":"649","article-title":"Character-level convolutional networks for text classification","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Zhang"},{"key":"ref35","article-title":"LEAF: A benchmark for federated settings","author":"Caldas","year":"2018","journal-title":"arXiv:1812.01097"},{"key":"ref36","article-title":"Network in network","author":"Lin","year":"2014","journal-title":"arXiv:1312.4400"},{"key":"ref37","first-page":"8026","article-title":"PyTorch: An imperative style, high-performance deep learning library","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Paszke"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.5555\/3045118.3045167"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1162"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3457388.3458655"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10811896.pdf?arnumber=10811896","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,28]],"date-time":"2024-12-28T06:04:20Z","timestamp":1735365860000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10811896\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":40,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3521009","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}