Generalization Error Analysis for Attack-Free and Byzantine-Resilient Decentralized Learning with Data Heterogeneity
Not on the map. Why?
Abstract (arXiv)
Decentralized learning, which facilitates joint model training across geographically scattered agents, has gained significant attention in the field of signal and information processing in recent years. While the optimization errors of decentralized learning algorithms have been extensively studied, their generalization errors remain relatively under-explored. As the generalization errors reflect the scalability of trained models on unseen data and are crucial in determining the performance of trained models in real-world applications, understanding the generalization errors of decentralized learning is of paramount importance. In this paper, we present fine-grained generalization error analysis for both attack-free and Byzantine-resilient decentralized learning with heterogeneous data as well as under mild assumptions, in contrast to prior studies that consider homogeneous data and/or rely on a stringent bounded stochastic gradient assumption. Our results shed light on the impact of data heterogeneity, model initialization and stochastic gradient noise -- factors that have not been closely investigated before -- on the generalization error of decentralized learning. We also reveal that Byzantine attacks performed by malicious agents largely affect the generalization error, and their negative impact is inherently linked to the data heterogeneity while remaining independent on the sample size. Numerical experiments on both convex and non-convex tasks are conducted to validate our theoretical findings.
Key facts. Cited by 1 paper in the map (data through 13 Oct 2026). Builds on 34 of its 62 references that are in the map. First posted on arXiv 11 Jun 2025.
Builds on
34 of 62 references.
References · 34
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,653
- 2018Federated Optimization in Heterogeneous Networkscited by 2,981
- 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
- 2015Train faster, generalize better: Stability of stochastic gradient descentcited by 549
- 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 500
- 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 364
- 2019The Non-IID Data Quagmire of Decentralized Machine Learningcited by 304
- 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 287
- 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 220
- 2020FedPD: A Federated Learning Framework with Optimal Rates and Adaptivity to Non-IID Datacited by 144
- 2020Fine-Grained Analysis of Stability and Generalization for Stochastic Gradient Descentcited by 118
- 2017Data-Dependent Stability of Stochastic Gradient Descentcited by 91
22 more
- 2020An improved convergence analysis for decentralized online stochastic non-convex optimizationcited by 53
- 2019BRIDGE: Byzantine-resilient Decentralized Gradient Descentcited by 45
- 2021A Unified and Refined Convergence Analysis for Non-Convex Decentralized Learningcited by 44
- 2022Topology-aware Generalization of Decentralized SGDcited by 37
- 2023Three-Way Trade-Off in Multi-Objective Learning: Optimization, Generalization and Conflict-Avoidancecited by 35
- 2021Stability of SGD: Tightness Analysis and Improved Boundscited by 33
- 2021Removing Data Heterogeneity Influence Enhances Network Topology Dependence of Decentralized SGDcited by 29
- 2023Understanding Generalization of Federated Learning via Stability: Heterogeneity Matterscited by 27
- 2022Byzantine-Resilient Decentralized Stochastic Optimization with Robust Aggregation Rulescited by 23
- 2023Accelerating Hybrid Federated Learning Convergence under Partial Participationcited by 15
- 2023Improved Stability and Generalization Guarantees of the Decentralized SGD Algorithmcited by 10
- 2023On the Tradeoff between Privacy Preservation and Byzantine-Robustness in Decentralized Learningcited by 8
- 2024The Effectiveness of Local Updates for Decentralized Learning under Data Heterogeneitycited by 7
- 2023On the Geometric Convergence of Byzantine-Resilient Distributed Optimization Algorithmscited by 6
- 2024Generalization of Geometric Graph Neural Networks with Lipschitz Loss Functionscited by 6
- 2024Locally Differentially Private Online Federated Learning With Correlated Noisecited by 6
- 2025Optimal Complexity in Byzantine-Robust Distributed Stochastic Optimization with Data Heterogeneitycited by 6
- 2024Fine-Tuning Personalization in Federated Learning to Mitigate Adversarial Clientscited by 5
- 2024Generalization Error Matters in Decentralized Learning Under Byzantine Attackscited by 4
- 2025From Centralized to Decentralized Federated Learning: Theoretical Insights, Privacy Preservation, and Robustness Challengescited by 4
- 2023Dual-domain Defenses for Byzantine-resilient Decentralized Resource Allocationcited by 3
- 2024Sensitivity Curve Maximization: Attacking Robust Aggregators in Distributed Learningcited by 1
Built on by
Citing papers per year: 2026: 1.
1 paper.