{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T06:53:21Z","timestamp":1759042401343},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,4]],"date-time":"2023-06-04T00:00:00Z","timestamp":1685836800000},"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":[],"published-print":{"date-parts":[[2023,6,4]]},"DOI":"10.1109\/icassp49357.2023.10095468","type":"proceedings-article","created":{"date-parts":[[2023,5,5]],"date-time":"2023-05-05T17:28:30Z","timestamp":1683307710000},"page":"1-5","source":"Crossref","is-referenced-by-count":5,"title":["Byzantine-Robust and Communication-Efficient Personalized Federated Learning"],"prefix":"10.1109","author":[{"given":"Xuechao","family":"He","sequence":"first","affiliation":[{"name":"Sun Yat-Sen University"}]},{"given":"Jiaojiao","family":"Zhang","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology"}]},{"given":"Qing","family":"Ling","sequence":"additional","affiliation":[{"name":"Sun Yat-Sen University"}]}],"member":"263","reference":[{"article-title":"Federated learning: Strategies for improving communication efficiency","year":"2016","author":"Kone\u010dn\u00fd","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNNLS.2022.3160699"},{"key":"ref3","article-title":"Federated learning based on dynamic regularization","author":"Acar","year":"2021","journal-title":"ICLR"},{"key":"ref4","article-title":"Personalized federated learning with Moreau envelopes","author":"Dinh","year":"2020","journal-title":"NeurIPS"},{"article-title":"Federated learning of a mixture of global and local models","year":"2020","author":"Hanzely","key":"ref5"},{"key":"ref6","article-title":"Lower bounds and optimal algorithms for personalized federated learning","author":"Hanzely","year":"2020","journal-title":"NeurIPS"},{"key":"ref7","article-title":"QSGD: Communicationefficient SGD via gradient quantization and encoding","author":"Alistarh","year":"2017","journal-title":"NeurIPS"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2985917"},{"key":"ref9","article-title":"Sparsified SGD with memory","author":"Stich","year":"2020","journal-title":"NeurIPS"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2907258"},{"key":"ref11","article-title":"LAG: Lazily aggregated gradient for communication-efficient distributed learning","author":"Chen","year":"2018","journal-title":"NeurIPS"},{"key":"ref12","article-title":"Communication-efficient learning of deep networks from decentralized data","author":"McMahan","year":"2017","journal-title":"AISTATS"},{"key":"ref13","article-title":"Local SGD converges fast and communicates little","author":"Stich","year":"2019","journal-title":"ICLR"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/357172.357176"},{"key":"ref15","article-title":"An equivalence between data poisoning and Byzantine gradient attacks","author":"Farhadkhani","year":"2022","journal-title":"ICML"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897647"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/3292040.3219655"},{"key":"ref18","article-title":"Byzantinerobust distributed learning: Towards optimal statistical rates","author":"Yin","year":"2018","journal-title":"ICML"},{"key":"ref19","article-title":"Byzantine-robust learning on heterogeneous datasets via bucketing","author":"Karimireddy","year":"2022","journal-title":"ICLR"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"article-title":"Communication-efficient robust federated learning over heterogeneous datasets","year":"2020","author":"Dong","key":"ref21"},{"key":"ref22","article-title":"signSGD with majority vote is communication efficient and Byzantine fault tolerant","author":"Bernstein","year":"2019","journal-title":"ICLR"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3105076"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746746"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747090"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2022.3153135"},{"key":"ref27","article-title":"Stochastic controlled averaging for federated learning","author":"Karimireddy","year":"2020","journal-title":"ICML"}],"event":{"name":"ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2023,6,4]]},"location":"Rhodes Island, Greece","end":{"date-parts":[[2023,6,10]]}},"container-title":["ICASSP 2023 - 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10094559\/10094560\/10095468.pdf?arnumber=10095468","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,29]],"date-time":"2024-02-29T22:40:41Z","timestamp":1709246441000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10095468\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,4]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icassp49357.2023.10095468","relation":{},"subject":[],"published":{"date-parts":[[2023,6,4]]}}}