{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,4]],"date-time":"2026-06-04T16:06:54Z","timestamp":1780589214713,"version":"3.54.1"},"reference-count":27,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,23]],"date-time":"2022-05-23T00:00:00Z","timestamp":1653264000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100019318","name":"Guangdong Province Key Laboratory of Computational Science","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100019318","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,23]]},"DOI":"10.1109\/icassp43922.2022.9747090","type":"proceedings-article","created":{"date-parts":[[2022,4,27]],"date-time":"2022-04-27T19:50:34Z","timestamp":1651089034000},"page":"5223-5227","source":"Crossref","is-referenced-by-count":5,"title":["Byzantine-Robust and Communication-Efficient Distributed Non-Convex Learning Over Non-IID Data"],"prefix":"10.1109","author":[{"given":"Xuechao","family":"He","sequence":"first","affiliation":[{"name":"Sun Yat-Sen University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Heng","family":"Zhu","sequence":"additional","affiliation":[{"name":"Sun Yat-Sen University"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Qing","family":"Ling","sequence":"additional","affiliation":[{"name":"Sun Yat-Sen University"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/3154503"},{"key":"ref11","article-title":"Byzantine-robust distributed learning: Towards optimal statistical rates","author":"yin","year":"2018"},{"key":"ref12","article-title":"Machine learning with adversaries: Byzantine tolerant gradient descent","author":"blanchard","year":"2017","journal-title":"NerIPS"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2946020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33011544"},{"key":"ref15","article-title":"Byzantine-robust learning on heterogeneous datasets via resampling","author":"he","year":"2020"},{"key":"ref16","article-title":"Federated optimization in heterogeneous networks","author":"li","year":"2020","journal-title":"MLSys"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9052956"},{"key":"ref18","article-title":"Zeno++: Robust fully asynchronous SGD","author":"xie","year":"2020","journal-title":"ICML"},{"key":"ref19","article-title":"Learning from history for Byzantine robust optimization","author":"karimireddy","year":"2021","journal-title":"ICML"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2018.2846297"},{"key":"ref27","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/18M1178244","article-title":"Stochastic model-based minimization of weakly convex functions","volume":"29","author":"damek","year":"2019","journal-title":"SIAM Journal on Optimization"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000083"},{"key":"ref6","article-title":"LAG: Lazily aggregated gradient for communication-efficient distributed learning","author":"chen","year":"2018","journal-title":"NeurIPS"},{"key":"ref5","article-title":"Local SGD converges fast and communicates little","author":"stich","year":"2019","journal-title":"ICLRE"},{"key":"ref8","article-title":"Sparsified SGD with memory","author":"stich","year":"2020","journal-title":"NeurIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.2985917"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/3298981"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2020.2973345"},{"key":"ref1","article-title":"Federated learning: Strategies for improving communication efficiency","author":"konecny","year":"2016"},{"key":"ref20","article-title":"Defending against saddle point attack in Byzantine-robust distributed learning","author":"yin","year":"2019","journal-title":"ICML"},{"key":"ref22","article-title":"SignSGD with majority vote is communication efficient and fault tolerant","author":"bernstein","year":"2019","journal-title":"ICLRE"},{"key":"ref21","article-title":"Byzantine-resilient non-convex stochastic gradient descent","author":"allen","year":"2020"},{"key":"ref24","article-title":"BROADCAST: Reducing both stochastic and compression noise to robustify communication-efficient federated learning","author":"zhu","year":"2021"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT44484.2020.9174391"},{"key":"ref26","article-title":"FLTrust: Byzantine-robust federated learning via trust bootstrapping","author":"cao","year":"2020"},{"key":"ref25","article-title":"Communication-efficient robust federated learning over heterogeneous datasets","author":"dong","year":"2020"}],"event":{"name":"ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","location":"Singapore, Singapore","start":{"date-parts":[[2022,5,23]]},"end":{"date-parts":[[2022,5,27]]}},"container-title":["ICASSP 2022 - 2022 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9745891\/9746004\/09747090.pdf?arnumber=9747090","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,8,22]],"date-time":"2022-08-22T20:12:40Z","timestamp":1661199160000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9747090\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,23]]},"references-count":27,"URL":"https:\/\/doi.org\/10.1109\/icassp43922.2022.9747090","relation":{},"subject":[],"published":{"date-parts":[[2022,5,23]]}}}