Distributed Statistical Machine Learning in Adversarial Settings: Byzantine Gradient Descent
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Abstract
We consider the distributed statistical learning problem over decentralized systems that are prone to adversarial attacks. This setup arises in many practical applications, including Google's Federated Learning. Formally, we focus on a decentralized system that consists of a parameter server and m working machines; each working machine keeps N/m data samples, where N is the total number of samples. In each iteration, up to q of the m working machines suffer Byzantine faults -- a faulty machine in the given iteration behaves arbitrarily badly against the system and has complete knowledge of the system. Additionally, the sets of faulty machines may be different across iterations. Our goal is to design robust algorithms such that the system can learn the underlying true parameter, which is of dimension d, despite the interruption of the Byzantine attacks. In this paper, based on the geometric median of means of the gradients, we propose a simple variant of the classical gradient descent method. We show that our method can tolerate q Byzantine failures up to 2(1+ε)q ≤ for an arbitrarily small but fixed constant ε > 0. The parameter estimate converges in O(log N) rounds with an estimation error on the order of max{√dq/N, √d/N, which is larger than the minimax-optimal error rate √d/N in the centralized and failure-free setting by at most a factor of √q. The total computational complexity of our algorithm is of O((Nd/m) log N) at each working machine and O(md + kd log3 N) at the cen…
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Apart from preserving privacy for individual users, edge AI also needs to be robust to errors and adversarial attackers, as the decentralized nature makes it easy to be unreliable in the learning process or even completely controlled by external attackers [74].”
From Edge artificial intelligence for 6g: vision, enabling technologies, and applications (2022) · cites this paper as [74]
Citations
Cites
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476 · cited 2×
“Many efficient distributed machine learning algorithms [6, 13] and system implementations [24, 28, 10, 19] have been proposed and studied.”
BackgroundBoyd, S., Parikh, N., Chu, E., Peleato, B., & Eckstein, J. (2011) · Foundations and Trends® in Machine Learning · doi:10.1561/2200000016 · Cited by 17,075
(1992) · Lecture Notes in Computer Science · doi:10.1007/bfb0022433 · Cited by 3,955
Privacy-preserving data mining
Agrawal, R., & Srikant, R. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335438 · Cited by 2,961
Distributed GraphLab: a framework for machine learning and data mining in the cloud
Low, Y., Bickson, D., Gonzalez, J., Guestrin, C., Kyrola, A., & Hellerstein, J. M. (2012) · Proceedings of the VLDB Endowment · doi:10.14778/2212351.2212354 · Cited by 1,653 · cited 2×
“Many efficient distributed machine learning algorithms [6, 13] and system implementations [24, 28, 10, 19] have been proposed and studied.”
BackgroundNetwork Security: Private Communication in a Public World
Kaufman, C., Perlman, R., & Speciner, M. (1995) · Cited by 730
Geometric median and robust estimation in Banach spaces
Minsker, S. (2015) · Bernoulli · doi:10.3150/14-bej645 · Cited by 261
Agnostic Estimation of Mean and Covariance
Lai, K. A., Rao, A. B., & Vempala, S. (2016) · 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2016.76 · Cited by 204 · cited 1×
“A recent line of work [8, 15] presents polynomial algorithms to consistently estimate the mean and covariance of a distribution from N i.”
BackgroundRobust Estimators in High Dimensions without the Computational Intractability
Diakonikolas, I., Kamath, G., Kane, D. M., Li, J., Moitra, A., & Stewart, A. (2016) · 2016 IEEE 57th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2016.85 · Cited by 200 · cited 1×
“A recent line of work [8, 15] presents polynomial algorithms to consistently estimate the mean and covariance of a distribution from N i.”
BackgroundCommunication-efficient algorithms for statistical optimization
(2013) · Journal of Machine Learning Research · doi:10.5555/2567709.2567769 · Cited by 195 · cited 1×
“One-Shot Aggregation: On the other end of the spectrum, using a One-Short Aggregation method, each working machine computes an estimate of the model parameter using only its local data and reports it to the server, which then aggregates all the estimates reported to obtain a final estimate [33, 32].”
Method
Research works printed but not linked: 15
- Peva Blanchard , El Mahdi El Mhamdi , Rachid Guerraoui, and Julien Stainer. 2017 . Byzantine-Tolerant Machine Learning . arXiv preprint arXiv:1703.02757 (2017). Peva Blanchard, El Mahdi El Mhamdi, Rachid Guerraoui, and Julien Stainer. 2017. Byzantine-Tolerant Machine Learning. arXiv preprint arXiv:1703.02757 (2017). · arXiv
- Stephen Boyd and Lieven Vandenberghe . 2004. Convex optimization . Cambridge university press . Stephen Boyd and Lieven Vandenberghe. 2004. Convex optimization. Cambridge university press.
- John Duchi Martin J Wainwright and Michael I Jordan. 2013. Local privacy and minimax bounds: Sharp rates for probability estimation. Advances in Neural Information Processing Systems. 1529--1537. John Duchi Martin J Wainwright and Michael I Jordan. 2013. Local privacy and minimax bounds: Sharp rates for probability estimation. Advances in Neural Information Processing Systems. 1529--1537.
- Jiashi Feng , Huan Xu , and Shie Mannor . 2014. Distributed Robust Learning. arXiv preprint arXiv:1409.5937 ( 2014 ). Jiashi Feng, Huan Xu, and Shie Mannor. 2014. Distributed Robust Learning. arXiv preprint arXiv:1409.5937 (2014). · arXiv
- Michael I Jordan , Jason D Lee , and Yun Yang . 2016. Communication-Efficient Distributed Statistical Inference. arXiv preprint arXiv:1605.07689 ( 2016 ). Michael I Jordan, Jason D Lee, and Yun Yang. 2016. Communication-Efficient Distributed Statistical Inference. arXiv preprint arXiv:1605.07689 (2016). · arXiv
- JHB Kemperman . 1987. The median of a finite measure on a Banach space. Statistical data analysis based on the L1-norm and related methods (Neuchâtel , 1987 ) (1987), 217--230. JHB Kemperman. 1987. The median of a finite measure on a Banach space. Statistical data analysis based on the L1-norm and related methods (Neuchâtel, 1987) (1987), 217--230.
- Jakub Konevcnỳ , Brendan McMahan , and Daniel Ramage . 2015. Federated optimization: Distributed optimization beyond the datacenter. arXiv preprint arXiv:1511.03575 ( 2015 ). Jakub Konevcnỳ, Brendan McMahan, and Daniel Ramage. 2015. Federated optimization: Distributed optimization beyond the datacenter. arXiv preprint arXiv:1511.03575 (2015). · arXiv
- Hendrik P Lopuhaa and Peter J Rousseeuw . 1991. Breakdown points of affine equivariant estimators of multivariate location and covariance matrices. The Annals of Statistics ( 1991 ), 229--248. Hendrik P Lopuhaa and Peter J Rousseeuw. 1991. Breakdown points of affine equivariant estimators of multivariate location and covariance matrices. The Annals of Statistics (1991), 229--248.
- Nancy A. Lynch . 1996. Distributed Algorithms . Morgan Kaufmann Publishers Inc ., San Francisco, CA, USA. \showISBNx9780080504704 Nancy A. Lynch. 1996. Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA. \showISBNx9780080504704
- Song Mei , Yu Bai , and Andrea Montanari . 2016. The landscape of empirical risk for non-convex losses. arXiv preprint arXiv:1607.06534 ( 2016 ). Song Mei, Yu Bai, and Andrea Montanari. 2016. The landscape of empirical risk for non-convex losses. arXiv preprint arXiv:1607.06534 (2016). · arXiv
- Philipp Moritz , Robert Nishihara , Ion Stoica , and Michael I Jordan . 2015 . Sparknet: Training deep networks in spark. arXiv preprint arXiv:1511.06051 (2015). Philipp Moritz, Robert Nishihara, Ion Stoica, and Michael I Jordan. 2015. Sparknet: Training deep networks in spark. arXiv preprint arXiv:1511.06051 (2015). · arXiv
- Charles P. Pfleeger and Shari Lawrence Pfleeger . 2002 . Security in Computing (3rd ed.). Prentice Hall Professional Technical Reference . Charles P. Pfleeger and Shari Lawrence Pfleeger. 2002. Security in Computing (3rd ed.). Prentice Hall Professional Technical Reference.
- Foster J Provost and Daniel N Hennessy . 1996 . Scaling up: Distributed machine learning with cooperation . AAAI/IAAI , Vol. 1 . Citeseer, 74--79. Foster J Provost and Daniel N Hennessy. 1996. Scaling up: Distributed machine learning with cooperation. AAAI/IAAI, Vol. 1. Citeseer, 74--79.
- R. Vershynin . 2010. Introduction to the non-asymptotic analysis of random matrices. Arxiv preprint arxiv:1011.3027 ( 2010 ). R. Vershynin. 2010. Introduction to the non-asymptotic analysis of random matrices. Arxiv preprint arxiv:1011.3027 (2010). · arXiv
- 10.5555/1833515.1833620 · doi:10.5555/1833515.1833620
Cited by
Items 201–300 of 390
Byzantine-Resilient Gradient Coding Through Local Gradient Computations
Hofmeister, C., Maßny, L., Yaakobi, E., & Bitar, R. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3542896 · Cited by 6
Coordinate-Wise Median in Byzantine Federated Learning
Cambus, M., Melnyk, D., Milentijević, T., & Schmid, S. (2025) · doi:10.1145/3709023.3737691 · Cited by 4
Cross the Chasm: Scalable Privacy-Preserving Federated Learning against Poisoning Attack
Li, Y., Hu, G., Liu, X., & Ying, Z. (2021) · Conference on Privacy, Security and Trust · doi:10.1109/pst52912.2021.9647750 · Cited by 7
A Blockchain-based Grouped Federated Learning Scheme Against Malicious Clients
Guo, H., Mao, Y., He, X., & Nie, H. (2021) · IEEE Globecom Workshops (GC Wkshps) · doi:10.1109/gcwkshps52748.2021.9682070 · Cited by 4
BYRDIE: A BYZANTINE-RESILIENT DISTRIBUTED LEARNING ALGORITHM
Yang, Z., & Bajwa, W. U. (2018) · IEEE Data Science Workshop (DSW) · doi:10.1109/dsw.2018.8439115 · Cited by 4
“A recent work [20] solves a vector-valued distributed learning problem under Byzantine failures, but it requires a central processing center.”
BackgroundOn Byzantine-Resilient High-Dimensional Stochastic Gradient Descent
Data, D., & Diggavi, S. N. (2020) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit44484.2020.9174363 · Cited by 6
Odeyomi, O. T., Olowu, T. O., Ajibuwa, O., & Homaifar, A. (2025) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2025.3579245 · Cited by 3
Enhancing Security in Parallel Federated Learning With Sharded Blockchain for Internet of Vehicles
Tian, L., Lin, F., Gan, J., Qi, J., Jia, R., Zheng, Z., Li, M., & Shen, X. (2025) · IEEE Transactions on Vehicular Technology · doi:10.1109/tvt.2025.3593493 · Cited by 7
A Reputation-Aware Defense Framework for Strategic Behaviors in Federated Learning
Cai, Y., Xu, J., Lian, Z., Brian, K. C. W., Li, Y., & Xu, J. (2025) · Telecom · doi:10.3390/telecom6030060 · Cited by 6
Self-citationPractical Framework for Privacy-Preserving and Byzantine-Robust Federated Learning
Zhang, B., Fang, M., Liu, Z., Yi, B., Zhou, P., Wang, Y., Li, T., & Liu, Z. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3642546 · Cited by 6
Ajibuwa, O., & Odeyomi, O. T. (2025) · IEEE International Performance, Computing, and Communications Conference · doi:10.1109/ipccc66453.2025.11304645 · Cited by 3
Tran, T.-D., Bui, P.-H., & Pham, V.-H. (2026) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2026.103701 · Cited by 3
Byzantine-Resilient Federated Learning With Trust-Aware Task Scheduling for Heterogeneous UAV Swarms
Guo, W., Xiao, Y., Li, D., Cheng, S., Li, Y., Liu, J., Li, W., Wang, L., & Wu, Q. (2026) · IEEE Transactions on Consumer Electronics · doi:10.1109/tce.2026.3670496 · Cited by 4
ARMOR: Differential Model Distribution for Adversarially Robust Federated Learning
Zhang, Y., Liu, J., Guan, Z., Zhao, B., Leng, X., & Bian, S. (2023) · Electronics · doi:10.3390/electronics12040842 · Cited by 5
Byzantine-Robust Federated Learning Based on Multi-center Secure Clustering
Liu, X., Xu, C., & Zhang, P. (2023) · International Conference on Electronics, Computers and Communication Technology (CECCT) · doi:10.1145/3637494.3638729 · Cited by 3
On The Resilience Of Online Federated Learning To Model Poisoning Attacks Through Partial Sharing
Lari, E., Gogineni, V. C., Arablouei, R., & Werner, S. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447497 · Cited by 4
Byzantine-Robust Federated Learning through Dynamic Clustering
Wang, H., Wang, L., & Li, H. (2023) · IEEE International Conference on Trust, Security and Privacy in Computing and Communications (TrustCom) · doi:10.1109/trustcom60117.2023.00050 · Cited by 3
Can Fairness and Robustness Be Simultaneously Achieved Under Byzantine Attacks?
Zheng, H., Wang, R., Xiao, W., & Ling, Q. H. (2025) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49660.2025.10890227 · Cited by 4
Resilience in Online Federated Learning: Mitigating Model-Poisoning Attacks via Partial Sharing
Lari, E., Arablouei, R., Gogineni, V. C., & Werner, S. (2025) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2025.3559444 · Cited by 5
Blockchain Empowered Secure Collaboration for Swarm Robots: Storage and Computation
Wang, R., Tang, S. H., Zhang, H., Duan, S., Zhang, X., & Xu, C. (2025) · IEEE Internet of Things Journal · doi:10.1109/jiot.2025.3591963 · Cited by 5
Enabling Trustworthy Federated Learning via Remote Attestation for Mitigating Byzantine Threats
Zhang, C., Jin, H., Shi, S., Yu, H., Johns, S., Hou, Y. T., & Lou, W. (2025) · IEEE Military Communications Conference (MILCOM) · doi:10.1109/milcom64451.2025.11310549 · Cited by 8
Malicious Model Detection for Federated Learning Empowered Energy Storage Systems
Wang, X., Chen, Y., & Dobre, O. A. (2023) · 2012 International Conference on Computing, Networking and Communications (ICNC) · doi:10.1109/icnc57223.2023.10074032 · Cited by 5
“GeoMed [10] takes the geometric median of all models as the model aggregation.”
MethodSelf-citationSikandar, H. S., Malik, S. U. R., Anjum, A., Khan, A., & Jeon, G. (2023) · Future Generation Computer Systems · doi:10.1016/j.future.2023.07.037 · Cited by 5
Anika, T. (2023) · Systematic Literature Review and Meta-Analysis Journal · doi:10.54480/slr-m.v3i4.42 · Cited by 4
FedXPro: Bayesian Inference for Mitigating Poisoning Attacks in IoT Federated Learning
Indrasiri, P. L., Nguyen, D. C., Kashyap, B., Pathirana, P. N., & Eldar, Y. C. (2023) · IEEE Internet of Things Journal · doi:10.1109/jiot.2023.3334298 · Cited by 5
RobustHealthFL: Robust Strategy Against Malicious Clients in Non-iid Healthcare Federated Learning*
Peng, X., Tang, W., Xie, K., Liu, X., Zhao, P., & Peng, S. (2023) · IEEE International Conference on Bioinformatics and Biomedicine (BIBM) · doi:10.1109/bibm58861.2023.10385849 · Cited by 3
Zhu, Z., Huang, Y. T., Zhao, C., & Xu, J. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383346 · Cited by 3
Self-citationDutta, A., Doan, T. T., & Reed, J. H. (2023) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc49753.2023.10383715 · Cited by 5
On the Generalization Error of Byzantine-Resilient Decentralized Learning
Ye, H., & Ling, Q. H. (2024) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp48485.2024.10447366 · Cited by 3
Brief Announcement: A Case for Byzantine Machine Learning
Farhadkhani, S., Guerraoui, R., Gupta, N., & Pinot, R. (2024) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3662158.3662802 · Cited by 6
Rodríguez-Barroso, N., Ser, J. D., Luzón, M. V., & Herrera, F. (2024) · IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) · doi:10.1109/fuzz-ieee60900.2024.10611769 · Cited by 6
Byzantine-Resilient Federated Principal Subspace Estimation
Singh, A. P., & Vaswani, N. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619161 · Cited by 3
Byzantine Resilient Non-Convex SCSG With Distributed Batch Gradient Computations
Bulusu, S., Khanduri, P., Kafle, S., Sharma, P., & Varshney, P. K. (2021) · IEEE Transactions on Signal and Information Processing over Networks · doi:10.1109/tsipn.2021.3129352 · Cited by 5
Impact of Redundancy on Resilience in Distributed Optimization and Learning
Liu, S., Gupta, N., & Vaidya, N. H. (2023) · International Conference on Distributed Computing and Networking (ICDCN) · doi:10.1145/3571306.3571393 · Cited by 3
Distributed robust statistical learning: Byzantine mirror descent
Ding, D., Wei, X., & Jovanović, M. R. (2019) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc40024.2019.9029491 · Cited by 3
Randomised block‐coordinate Frank‐Wolfe algorithm for distributed online learning over networks
Li, J., Wu, Q., Zheng, R., Zhu, J., Ge, Q., & Zhang, M. (2020) · Cognitive Computation and Systems · doi:10.1049/ccs.2020.0007 · Cited by 2
Robust high dimensional expectation maximization algorithm via trimmed hard thresholding
Wang, D., Guo, X., Li, S., & Xu, J. (2020) · Machine Learning · doi:10.1007/s10994-020-05926-z · Cited by 3
Self-citationA Brief Tutorial on Distributed and Concurrent Machine Learning
Alistarh, D. (2018) · ACM Symposium on Principles of Distributed Computing (PODC) · doi:10.1145/3212734.3212798 · Cited by 5
Resilient Federated Learning Using Trimmed-Clipping Aggregation
Bhowmick, C., & Koutsoukos, X. (2024) · IEEE International Conference on Trust, Privacy and Security in Intelligent Systems and Applications (TPS-ISA) · doi:10.1109/tps-isa62245.2024.00031 · Cited by 6
Runtime Backdoor Detection for Federated Learning via Representational Dissimilarity Analysis
Zhang, X., Xue, X., Du, X., Xie, X., Liu, Y., & Sun, M. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3550330 · Cited by 9
Rattanavipanon, N., & Nunes, I. D. O. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3555179 · Cited by 8
Model Poisoning Detection and Dismissal Safeguarding Federated Learning Against Malicious Attacks
Rahman, M. M., Debnath, A. C., & Giordano, S. (2024) · IEEE International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD) · doi:10.1109/camad62243.2024.10942888 · Cited by 2
Xue, K., Li, J., Xue, R., Xue, Y., & Zhao, J. (2025) · IEEE Transactions on Network Science and Engineering · doi:10.1109/tnse.2025.3632902 · Cited by 3
Ye, H., Zhu, H., & Ling, Q. (2026) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3642292 · Cited by 3
Garg, A., Bansal, N., Yadav, S., Kandhoul, N., Dhurandher, S. K., & Woungang, I. (2026) · Journal of Information Security and Applications · doi:10.1016/j.jisa.2025.104358 · Cited by 2
A Trustworthy Federated Learning Framework for Joint Privacy and Byzantine Resilience
Shu, J., Hu, Z., Wang, F., He, Y., Lu, H. D., & Tian, Z. (2026) · IEEE Internet of Things Journal · doi:10.1109/jiot.2026.3651363 · Cited by 1
Zhang, J., He, Y., Deng, X., Yu, X., Liu, S., & Wang, E. (2026) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2026.3658772 · Cited by 2
Adaptive Federated Learning Defense Against Byzantine Attacks and Concept Drift in IIoT
Alhelou, A., Singh, A. K., & Wang, X. (2026) · IEEE International Symposium on Circuits and Systems proceedings · doi:10.1109/iscas66217.2026.11562686 · Cited by 2
TiBroco: A Fast and Secure Distributed Learning Framework for Tiered Wireless Edge Networks
Han, D.-J., Sohn, J.-Y., & Moon, J. J. (2021) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infocom42981.2021.9488860 · Cited by 2
Efficient federated learning under non-IID conditions with attackers
Zou, H., Zhang, Y., Que, X.-R., Liang, Y., & Crowcroft, J. (2022) · FedEdge@MobiCom · doi:10.1145/3556557.3557951 · Cited by 5
Robust Federated Learning For Image Semantic Transmission Under Byzantine Attacks
Song, Y., Wang, J., & Liu, Y. (2023) · IEEE/CIC International Conference on Communications in China (ICCC) · doi:10.1109/icccworkshops57813.2023.10233811 · Cited by 4
MS-FL: A Federated Learning Framework Based on Multiple Security Strategies
Yang, W.-T., Kang, P., & Wei, C. (2024) · IEEE Access · doi:10.1109/access.2024.3353131 · Cited by 3
Locality-Aware and Fault-Tolerant Batching for Machine Learning on Distributed Datasets
Liu, L., Ding, Z., Cheng, D., & Zhou, X. (2024) · IEEE Transactions on Cloud Computing · doi:10.1109/tcc.2024.3351716 · Cited by 2
AFL: Attention-Based Byzantine-Robust Federated Learning with Vector Filter
Chen, H., Lv, X., & Zheng, W. (2023) · Globecom · doi:10.1109/globecom54140.2023.10437587 · Cited by 3
FedREAS: A Robust Efficient Aggregation and Selection Framework for Federated Learning
Fan, S., Wang, C., Ruan, X., Shi, H., Ma, R., & Guan, H. (2024) · ACM Transactions on Asian and Low-Resource Language Information Processing · doi:10.1145/3670689 · Cited by 2
Decentralized Optimization Resilient Against Local Data Poisoning Attacks
Mao, Y., Data, D., Diggavi, S. N., & Paulo Tabuada, B. (2024) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2024.3424693 · Cited by 2
Byzantine-Robust Compressed and Momentum-based Variance Reduction in Federated Learning
Mao, S., Zhang, J., Hu, X., & Zheng, X. (2024) · International Conference on Computer Supported Cooperative Work in Design (CSCWD) · doi:10.1109/cscwd61410.2024.10580498 · Cited by 2
Robust Distributed Gradient Descent to Corruption over Noisy Channels
Wang, S., & Tan, V. Y. F. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619340 · Cited by 2
Byzantine-Resilient Bilevel Federated Learning
Abbas, M., Zhou, Y. X., Baracaldo, N., Samulowitz, H., Ram, P., & Salonidis, T. (2024) · IEEE Sensor Array and Multichannel Signal Processing Workshop (SAM) · doi:10.1109/sam60225.2024.10636694 · Cited by 2
Byzantine-Robust Aggregation for Federated Learning with Reinforcement Learning
Yan, S., Du, J., Xue, Z., & Li, A. (2024) · Lecture notes in computer science · doi:10.1007/978-981-97-7241-4_10 · Cited by 3
Towards Practical Homomorphic Aggregation in Byzantine-Resilient Distributed Learning
Choffrut, A., Guerraoui, R., Pinot, R., Sirdey, R., Stephan, J., & Zuber, M. (2024) · International Middleware Conference · doi:10.1145/3652892.3700783 · Cited by 10
Training Fair Models in Federated Learning without Data Privacy Infringement
Che, X., Hu, J., Zhou, Z., Zhang, Y., & Chu, L. (2024) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata62323.2024.10825911 · Cited by 58
A Mirror Descent-Based Algorithm for Corruption-Tolerant Distributed Gradient Descent
Wang, S., & Tan, V. Y. F. (2025) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2025.3539883 · Cited by 2
Shi, J., Wang, W., Hu, Y., & Lin, Y. (2025) · IEEE Transactions on Cognitive Communications and Networking · doi:10.1109/tccn.2025.3561316 · Cited by 4
Sign-Based Distributed Learning With Byzantine Resilience Based on Audit Mechanism
Li, C., Xiao, M., & Skoglund, M. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3575582 · Cited by 2
Ranjan, P., Gupta, A., & Das, S. K. (2025) · IEEE International Conference on Smart Computing · doi:10.1109/smartcomp65954.2025.00063 · Cited by 4
Byzantine-Robust Federated Learning
Liu, Z., Guo, Q., Hu, Y., Aseeri, A., Li, D., & Zhang, R. (2025) · International Conference on Computer Communications and Networks (ICCCN) · doi:10.1109/icccn65249.2025.11134006 · Cited by 2
Optimal Communication-Computation Trade-Off in Hierarchical Gradient Coding
Gholami, A., Jahani-Nezhad, T., Wan, K., & Caire, G. (2025) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit63088.2025.11195435 · Cited by 2
Rahman, M. S., Elmahallawy, M., Madria, S., & Frimpong, S. (2025) · IEEE International Conference on Mobile Ad-Hoc and Sensor Systems (MASS) · doi:10.1109/mass66014.2025.00061 · Cited by 2
Private Aggregation for Byzantine-Resilient Heterogeneous Federated Learning
Egger, M., & Bitar, R. (2025) · IEEE Information Theory Workshop (ITW) · doi:10.1109/itw62417.2025.11240449 · Cited by 3
Stochastic Admm For Byzantine-Robust Distributed Learning
Lin, F., Ling, Q. H., Li, W., & Xiong, Z. (2020) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp40776.2020.9053700 · Cited by 2
Xu, J., Tong, X., & Huang, S. (2022) · International Conference on Communications · doi:10.1109/icc45855.2022.9838792 · Cited by 2
Self-citationByzantine Resilient Aggregation in Distributed Reinforcement Learning
Li, J., Cai, F., & Koutsoukos, X. (2021) · Lecture notes in networks and systems · doi:10.1007/978-3-030-86261-9_6 · Cited by 2
MANDERA: Malicious node detection in federated learning via ranking
Zhu, W., Zhao, B. Z. H., Luo, S., & Deng, K. (2026) · The Annals of Applied Statistics · doi:10.1214/26-aoas2147 · Cited by 4
“…malicious actors in the collaborative process may seek to poison the performance of the global model, to reduce the output performance of the model (Chen et al., 2017; Baruch et al., 2019; Fang et al., 2020; Tolpegin et al., 2020), or to embed hidden back-doors within the model (Bagdasaryan et…”
Distributed Statistical Min-Max Learning in the Presence of Byzantine Agents
Adibi, A., Mitra, A., Pappas, G. J., & Hassani, H. (2022) · IEEE Conference on Decision and Control (CDC) · doi:10.1109/cdc51059.2022.9993078 · Cited by 2
Distributed Online Learning With Adversarial Participants In An Adversarial Environment
Dong, X., Wu, Z., Ling, Q. H., & Tian, Z. (2023) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp49357.2023.10095178 · Cited by 2
“Therein, the basic idea is to replace the vulnerable mean aggregation in distributed stochastic gradient descent with robust aggregation rules, including coordinate-wise median [14], trimmed mean [14,15], geometric median [16], Krum [17], centered clipping [18], Phocas [19], FABA [20], etc.”
BackgroundDefending against Poisoning Attacks in Federated Learning from a Spatial-temporal Perspective
Gu, Z., Shi, J., Yang, Y., & He, L. (2023) · IEEE Symposium on Reliable Distributed Systems (SRDS) · doi:10.1109/srds60354.2023.00013 · Cited by 3
Personalized Federated Learning With Multiview Geometry Structure
Yan, Y., Wang, S., Sun, F., & Tong, X. (2024) · IEEE Internet of Things Journal · doi:10.1109/jiot.2024.3425435 · Cited by 5
Interactive Byzantine-Resilient Gradient Coding for General Data Assignments
Jain, S., Maßny, L., Hofmeister, C., Yaakobi, E., & Bitar, R. (2024) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit57864.2024.10619596 · Cited by 2
SLC: A Permissioned Blockchain for Secure Distributed Machine Learning against Byzantine Attacks
Liang, L., Cao, X., Zhang, J. J., & Sun, C. (2020) · Chinese Automation Congress · doi:10.1109/cac51589.2020.9327384 · Cited by 3
Robust Mean Estimation in High Dimensions: An Outlier Fraction Agnostic and Efficient Algorithm
Deshmukh, A., Liu, J., & Veeravalli, V. V. (2022) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit50566.2022.9834585 · Cited by 2
Robust Distributed Clustering With Redundant Data Assignment
Bulusu, S., Gandikota, V., Mazumdar, A., Rawat, A. S., & Varshney, P. K. (2025) · IEEE Transactions on Information Theory · doi:10.1109/tit.2025.3536323 · Cited by 1
Distributional and Byzantine Robust Decentralized Federated Learning
Zhang, K., Xu, P., & Tian, Z. (2025) · Conference on Information Sciences and Systems · doi:10.1109/ciss64860.2025.10944744 · Cited by 3
Swarm Dynamic Spectrum Access for Internet-of-Things
Wang, Y., Shen, B., Li, F., & Lam, K. (2025) · IEEE Wireless Communications and Networking Conference · doi:10.1109/wcnc61545.2025.10978419 · Cited by 1
Approximate Agreement Algorithms for Byzantine Collaborative Learning
Cambus, M., Melnyk, D., Milentijević, T., & Schmid, S. (2025) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/3694906.3743343 · Cited by 6
Zhao, Y., Cao, Y., Zhang, J., Zhang, Z., & Wang, W. (2025) · Expert Systems with Applications · doi:10.1016/j.eswa.2025.129502 · Cited by 1
RAFL: Reputation-Aware Federated Learning with hierarchical aggregation in LEO satellite networks
Xu, X., Li, Y., & Lu, L. (2025) · Journal of Systems Architecture · doi:10.1016/j.sysarc.2025.103565 · Cited by 2
LGP: Layerwise Gradient Purify for Robust Federated Learning Against Poisoning Attacks
Issa, W., Moustafa, N., Turnbull, B., & Tari, Z. (2025) · IEEE Transactions on Dependable and Secure Computing · doi:10.1109/tdsc.2025.3604778 · Cited by 2
Applications of Robust Statistics in Autonomous Driving
Werner, T. (2025) · IEEE Access · doi:10.1109/access.2025.3614064 · Cited by 3
UAV-Assisted Heterogeneous Federated Learning over the Air Against Byzantine Attacks
Fan, X., Li, G., Luo, C., Hong, Y., Chen, Z., Chen, T., & Huo, Y. (2025) · Tsinghua Science & Technology · doi:10.26599/tst.2024.9010167 · Cited by 1
Coded Robust Aggregation for Distributed Learning Under Byzantine Attacks
Li, C., Xiao, M., & Skoglund, M. (2025) · IEEE Transactions on Information Forensics and Security · doi:10.1109/tifs.2025.3624620 · Cited by 1
On The Impact of Different Batch Sizes on Byzantine Robustness in Federated Learning
Huang, X., Wei, Y., Li, Y., Zhao, Y., & Du, B. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11228782 · Cited by 1
BRAFL: Byzantine-Robust Aggregation Scheme for Federated Learning under Data Heterogeneity
Qiu, M., Liu, Z., Du, R., & Liang, X. (2025) · International Joint Conference on Neural Networks (IJCNN) · doi:10.1109/ijcnn64981.2025.11227774 · Cited by 1
Untargeted poisoning attack based on fake clients and its defense in federated learning
Wang, C., Xu, K., He, A., Sun, Z., Pan, J., & Ren, Y. (2025) · Cybersecurity · doi:10.1186/s42400-025-00389-y · Cited by 2
“First, most attack methods (Chen et al. 2017; Wan et al. 2021; Shejwalkar and Houmansadr 2021) are based on a key assumption that the adversary can control real clients.”
Unveiling Byzantine-robust with Varied Batch Sizes across Different Clients in Federated Learning
Li, Y., Wei, Y., Huang, X., & Du, B. (2025) · ACM International Conference on Multimedia in Asia (MMAsia) · doi:10.1145/3743093.3770940 · Cited by 2
Liang, Z., Zhang, R., & Kan, Y. (2025) · IEEE Global Conference on Consumer Electronics (GCCE) · doi:10.1109/gcce65946.2025.11275574 · Cited by 1
Yang, Y., Li, M., & Zhang, T. (2025) · IEEE Vehicular Technology Conference · doi:10.1109/vtc2025-fall65116.2025.11310264 · Cited by 1
PRODIGY: Proximity- and Dissimilarity-Based Byzantine-Robust Federated Learning
Ergisi, S., Maßny, L., & Bitar, R. (2025) · International Conference on Federated Learning Technologies and Applications (FLTA) · doi:10.1109/flta67013.2025.11336354 · Cited by 1
Distributed robust estimation and inference with contaminated data
Zhang, P., Zhou, W., & Ren, Z. (2026) · Electronic Journal of Statistics · doi:10.1214/26-ejs2492 · Cited by 1
Dynamic Regret for Byzantine-Robust Online Federated Learning
Tian, H., He, Q., Qu, Z., & Li, X. (2026) · IEEE Transactions on Signal Processing · doi:10.1109/tsp.2026.3673260 · Cited by 1
Metadata
- Authors
- Chen, Y., Su, L., & Xu, J.
- Affiliations
- Cornell University (US)
- University of Illinois Urbana-Champaign (US)
- Purdue University West Lafayette (US)
- Venue
- Proceedings of the ACM on Measurement and Analysis of Computing Systems
- Published
- 2017-12-19
- Volume
- 1
- Issue
- 2
- Pages
- 1-25
- ISSN
- 2476-1249 (ISSN-L)
- OpenAlex
- W4252654521
- Cited by
- 390
- References
- 15
- Citations by year
- 2026: 36 · 2025: 85 · 2024: 68 · 2023: 61 · 2022: 47 · 2021: 44 · 2020: 28 · 2019: 14 · 2018: 7
- FWCI
- 8.00
- Type
- journal article
- Language
- en
- Open access
- closed
- Locations
- Proceedings of the ACM on Measurement and Analysis of Computing Systems (publishedVersion)
- Funders
- NSF (CRII award 1657420; CCF-1704828; ECCS-1610543; CCF-0939370)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
- Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
- Physical Sciences › Engineering › Control and Systems Engineering › Distributed Control Multi-Agent Systems
- Keywords
- Byzantine faults, federated learning, decentralized systems, parameter server, linear regression, communication complexity
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.