mlsanityData to 14 Oct 2026

Robust and Efficient Collaborative Learning

arXiv 2510.08311 ↗First posted 9 Oct 2025cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Collaborative machine learning is challenged by training-time adversarial behaviors. Existing approaches to tolerate such behaviors either rely on a central server or induce high communication costs. We propose Robust Pull-based Epidemic Learning (RPEL), a novel, scalable collaborative approach to ensure robust learning despite adversaries. RPEL does not rely on any central server and, unlike traditional methods, where communication costs grow in O(n2) with the number of nodes n, RPEL employs a pull-based epidemic-based communication strategy that scales in O(n log n). By pulling model parameters from small random subsets of nodes, RPEL significantly lowers the number of required messages without compromising convergence guarantees, which hold with high probability. Empirical results demonstrate that RPEL maintains robustness in adversarial settings, competes with all-to-all communication accuracy, and scales efficiently across large networks.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 29 of its 38 references that are in the map. First posted on arXiv 9 Oct 2025.

Builds on

29 of 38 references.

References · 29

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2019Advances and Open Problems in Federated Learningcited by 3,046
  3. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,150
  4. 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
  5. 2018LEAF: A Benchmark for Federated Settingscited by 792
  6. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 724
  7. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  8. 2017Can Decentralized Algorithms Outperform Centralized Algorithms? A Case Study for Decentralized Parallel Stochastic Gradient Descentcited by 502
  9. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 367
  10. 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
  11. 2019Decentralized Stochastic Optimization and Gossip Algorithms with Compressed Communicationcited by 221
  12. 2017Asynchronous Decentralized Parallel Stochastic Gradient Descentcited by 159
17 more
  1. 2019Fall of Empires: Breaking Byzantine-tolerant SGD by Inner Product Manipulationcited by 141
  2. 2020Byzantine-Robust Learning on Heterogeneous Datasets via Bucketingcited by 128
  3. 2020Learning to Detect Malicious Clients for Robust Federated Learningcited by 88
  4. 2023Fixing by Mixing: A Recipe for Optimal Byzantine ML under Heterogeneitycited by 65
  5. 2020Byzantine-Resilient Non-Convex Stochastic Gradient Descentcited by 57
  6. 2020Collaborative Learning in the Jungle (Decentralized, Byzantine, Heterogeneous, Asynchronous and Nonconvex Learning)cited by 54
  7. 2022Byzantine-Robust Decentralized Learning via ClippedGossipcited by 31
  8. 2023Epidemic Learning: Boosting Decentralized Learning with Randomized Communicationcited by 21
  9. 2020Byzantine-Resilient SGD in High Dimensions on Heterogeneous Datacited by 17
  10. 2018Accelerated Gossip in Networks of Given Dimension using Jacobi Polynomial Iterationscited by 15
  11. 2024Byzantine-Robust Federated Learning: Impact of Client Subsampling and Local Updatescited by 14
  12. 2021Secure Distributed Training at Scalecited by 12
  13. 2022Robust Collaborative Learning with Linear Gradient Overheadcited by 12
  14. 2024Unified Breakdown Analysis for Byzantine Robust Gossipcited by 8
  15. 2024Fine-Tuning Personalization in Federated Learning to Mitigate Adversarial Clientscited by 5
  16. 2023Beyond spectral gap (extended): The role of the topology in decentralized learningcited by 3
  17. 2024Byzantine-Robust Gossip: Insights from a Dual Approachcited by 1

Built on by

Not cited yet.