mlsanityData to 14 Oct 2026

How to Forget Clients in Federated Online Learning to Rank?

arXiv 2401.13410 ↗First posted 24 Jan 2024cs.CR cs.IR cs.LGcited by 4

On the map: LLM safety and security → Federated unlearning and poisoning

Abstract (arXiv)

Data protection legislation like the European Union's General Data Protection Regulation (GDPR) establishes the textitright to be forgotten: a user (client) can request contributions made using their data to be removed from learned models. In this paper, we study how to remove the contributions made by a client participating in a Federated Online Learning to Rank (FOLTR) system. In a FOLTR system, a ranker is learned by aggregating local updates to the global ranking model. Local updates are learned in an online manner at a client-level using queries and implicit interactions that have occurred within that specific client. By doing so, each client's local data is not shared with other clients or with a centralised search service, while at the same time clients can benefit from an effective global ranking model learned from contributions of each client in the federation. In this paper, we study an effective and efficient unlearning method that can remove a client's contribution without compromising the overall ranker effectiveness and without needing to retrain the global ranker from scratch. A key challenge is how to measure whether the model has unlearned the contributions from the client c^* that has requested removal. For this, we instruct c^* to perform a poisoning attack (add noise to this client updates) and then we measure whether the impact of the attack is lessened when the unlearning process has taken place. Through experiments on four datasets, we demonstrate the effectiveness and efficiency of the unlearning strategy under different combinations of parameter settings.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Placed in Federated unlearning and poisoning, one of 12 directions in LLM safety and security. Builds on 31 of its 51 references that are in the map. First posted on arXiv 24 Jan 2024.

Builds on

31 of 51 references.

Closest ancestors · 5

Same direction, newest first

  1. 2022Federated Unlearning: How to Efficiently Erase a Client in FL?12 Jul
  2. 2022VeriFi: Towards Verifiable Federated Unlearning25 May
  3. 2022The Right to be Forgotten in Federated Learning: An Efficient Realization with Rapid Retraining14 Mar
  4. 2022Federated Unlearning with Knowledge Distillation24 Jan
  5. 2021Federated Unlearning via Class-Discriminative Pruning22 Oct

Other references · 26

  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. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  4. 2019Machine Unlearningcited by 1,061
  5. 2017Evolution Strategies as a Scalable Alternative to Reinforcement Learningcited by 574
  6. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
  7. 2022A Survey of Machine Unlearningcited by 312
  8. 2019A Little Is Enough: Circumventing Defenses For Distributed Learningcited by 288
  9. 2020When Machine Unlearning Jeopardizes Privacycited by 198
  10. 2021Graph Unlearningcited by 138
  11. 2022Zero-Shot Machine Unlearningcited by 133
  12. 2020Machine Unlearning for Random Forestscited by 131
14 more
  1. 2013Introducing LETOR 4.0 Datasetscited by 121
  2. 2020Machine Unlearning: Linear Filtration for Logit-based Classifierscited by 95
  3. 2020Towards Probabilistic Verification of Machine Unlearningcited by 50
  4. 2022Federated Unlearning for On-Device Recommendationcited by 43
  5. 2021Certifiable Machine Unlearning for Linear Modelscited by 42
  6. 2020Coded Machine Unlearningcited by 36
  7. 2022Membership Inference via Backdooringcited by 27
  8. 2018Differentiable Unbiased Online Learning to Rankcited by 24
  9. 2018Efficient Exploration of Gradient Space for Online Learning to Rankcited by 9
  10. 2019Variance Reduction in Gradient Exploration for Online Learning to Rankcited by 9
  11. 2022Reinforcement Online Learning to Rank with Unbiased Reward Shapingcited by 4
  12. 2022Is Non-IID Data a Threat in Federated Online Learning to Rank?cited by 4
  13. 2023An Analysis of Untargeted Poisoning Attack and Defense Methods for Federated Online Learning to Rank Systemscited by 3
  14. 2022Learning Neural Ranking Models Online from Implicit User Feedbackcited by 1

Built on by

Cited by year

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

4 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024Effective and secure federated online learning to rank
  2. 2024Federated Unlearning: A Survey on Methods, Design Guidelines, and Evaluation Metrics
  3. 2025Federated Graph Unlearning
  4. 2023A Survey on Federated Unlearning: Challenges, Methods, and Future Directions
  5. 2024Privacy-Preserving Federated Unlearning with Certified Client Removal
  6. 2024Streamlined Federated Unlearning: Unite as One to Be Highly Efficient
  7. 2026Computation and Communication Efficient Federated Unlearning via On-server Gradient Conflict Mitigation and Expression
  8. 2026f-FUM: Federated Unlearning via min--max and f-divergence