mlsanityData to 14 Oct 2026

FRL: Federated Rank Learning

arXiv 2110.04350 ↗First posted 8 Oct 2021cs.LGcited by 8

Not on the map. Why?

Abstract (arXiv)

Federated learning (FL) allows mutually untrusted clients to collaboratively train a common machine learning model without sharing their private/proprietary training data among each other. FL is unfortunately susceptible to poisoning by malicious clients who aim to hamper the accuracy of the commonly trained model through sending malicious model updates during FL's training process. We argue that the key factor to the success of poisoning attacks against existing FL systems is the large space of model updates available to the clients, allowing malicious clients to search for the most poisonous model updates, e.g., by solving an optimization problem. To address this, we propose Federated Rank Learning (FRL). FRL reduces the space of client updates from model parameter updates (a continuous space of float numbers) in standard FL to the space of parameter rankings (a discrete space of integer values). To be able to train the global model using parameter ranks (instead of parameter weights), FRL leverage ideas from recent supermasks training mechanisms. Specifically, FRL clients rank the parameters of a randomly initialized neural network (provided by the server) based on their local training data. The FRL server uses a voting mechanism to aggregate the parameter rankings submitted by clients in each training epoch to generate the global ranking of the next training epoch. Intuitively, our voting-based aggregation mechanism prevents poisoning clients from making significant adversarial modifications to the global model, as each client will have a single vote! We demonstrate the robustness of FRL to poisoning through analytical proofs and experimentation. We also show FRL's high communication efficiency. Our experiments demonstrate the superiority of FRL in real-world FL settings.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 33 of its 45 references that are in the map. First posted on arXiv 8 Oct 2021.

Builds on

33 of 45 references.

References · 33

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
  2. 2015Delving Deep into Rectifiers: Surpassing Human-Level Performance on ImageNet Classificationcited by 3,611
  3. 2019Advances and Open Problems in Federated Learningcited by 3,046
  4. 2018Federated Optimization in Heterogeneous Networkscited by 2,987
  5. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,262
  6. 2013Estimating or Propagating Gradients Through Stochastic Neurons for Conditional Computationcited by 2,079
  7. 2019Federated Learning: Challenges, Methods, and Future Directionscited by 1,538
  8. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
  9. 2020Adaptive Federated Optimizationcited by 1,046
  10. 2019Measuring the Effects of Non-Identical Data Distribution for Federated Visual Classificationcited by 851
  11. 2019Towards Federated Learning at Scale: System Designcited by 832
  12. 2018LEAF: A Benchmark for Federated Settingscited by 792
21 more
  1. 2018How To Backdoor Federated Learningcited by 765
  2. 2018Byzantine-Robust Distributed Learning: Towards Optimal Statistical Ratescited by 711
  3. 2019Local Model Poisoning Attacks to Byzantine-Robust Federated Learningcited by 493
  4. 2018Sparsified SGD with Memorycited by 376
  5. 2018Analyzing Federated Learning through an Adversarial Lenscited by 351
  6. 2018The Hidden Vulnerability of Distributed Learning in Byzantiumcited by 329
  7. 2020Attack of the Tails: Yes, You Really Can Backdoor Federated Learningcited by 309
  8. 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
  9. 2019Can You Really Backdoor Federated Learning?cited by 255
  10. 2017Sparse Communication for Distributed Gradient Descentcited by 249
  11. 2019What's Hidden in a Randomly Weighted Neural Network?cited by 237
  12. 2018The Convergence of Sparsified Gradient Methodscited by 229
  13. 2020Supermasks in Superpositioncited by 227
  14. 2013Predicting Parameters in Deep Learningcited by 224
  15. 2019Deconstructing Lottery Tickets: Zeros, Signs, and the Supermaskcited by 207
  16. 2019Cronus: Robust and Heterogeneous Collaborative Learning with Black-Box Knowledge Transfercited by 93
  17. 2021Federated Evaluation and Tuning for On-Device Personalization: System Design & Applicationscited by 85
  18. 2019Communication-efficient distributed SGD with Sketchingcited by 81
  19. 2020LotteryFL: Personalized and Communication-Efficient Federated Learning with Lottery Ticket Hypothesis on Non-IID Datasetscited by 60
  20. 2020IBM Federated Learning: an Enterprise Framework White Paper V0.1cited by 57
  21. 2013Big Neural Networks Waste Capacitycited by 10

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 3; 2025: 1.

8 papers.