ConDa: Fast Federated Unlearning with Contribution Dampening
Vikram S Chundawat, Pushkar Niroula, Prasanna Dhungana, Stefan, Schoepf, Murari Mandal, Alexandra Brintrup

TL;DR
ConDa is a novel federated unlearning framework that efficiently removes a client's data from a shared model without retraining, significantly outperforming existing methods in speed and robustness.
Contribution
We propose Contribution Dampening (ConDa), a fast, retraining-free federated unlearning method that tracks and dampens parameters affected by a forgetting client.
Findings
ConDa outperforms state-of-the-art methods by at least 100x in unlearning speed.
ConDa effectively forgets client data on MNIST, CIFAR10, and CIFAR100 datasets.
ConDa is robust against backdoor and membership inference attacks.
Abstract
Federated learning (FL) has enabled collaborative model training across decentralized data sources or clients. While adding new participants to a shared model does not pose great technical hurdles, the removal of a participant and their related information contained in the shared model remains a challenge. To address this problem, federated unlearning has emerged as a critical research direction, seeking to remove information from globally trained models without harming the model performance on the remaining data. Most modern federated unlearning methods use costly approaches such as the use of remaining clients data to retrain the global model or methods that would require heavy computation on client or server side. We introduce Contribution Dampening (ConDa), a framework that performs efficient unlearning by tracking down the parameters which affect the global model for each client…
Peer Reviews
Decision·ICLR 2025 Conference Withdrawn Submission
The paper studies an interesting problem on data unlearning for federated learning. The proposed algorithm is simple and easy to understand. The authors also compared the performance of the proposed algorithm with several baselines.
I listed a few weaknesses below: 1. It is not clear to me why the proposed algorithm is designed for Non-IID cases? What is the special component in the proposed algorithm that used to tackle Non-iid case? Why other existing unlearning algorithm cannot deal with non-iid case? Any intuition? 2. There is no analysis on the additional storage requirements. Does it scale linear with the number of clients, and model size, etc? 3. As the author pointed out in the limitation section, the proposed algor
1. The paper presents a comprehensive evaluation of the proposed method.
1. The main problem is that the design of the unlearning algorithm in this paper simply follows the work by Foster et al. 2024 [42] (Fast Machine Unlearning Without Retraining Through Selective Synaptic Dampening) and applies it to federated learning. There is the lack of description of how the method proposed in this paper differs from the Selective Synaptic Dampening (SSD) [42]. 2. In general this algorithm (compared to the original SSD) brings even more additional parameters and this becomes
- Significant minimization of the computational overhead. - The studied problem is relevant and important.
- The paper assumes the following: - *A non-IID FL setup is highly challenging to unlearn.* - However, non-IID FL is difficult in general federated optimization scenarios but not in federated unlearning. - Because of this claim, I suspect the method might not work in the IID setting since it creates another spectrum of problems associated with the similarity of local data distributions. Let's compare it to traditional machine unlearning, where you have class-level unlearning, which is
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNetwork Packet Processing and Optimization · Machine Learning and ELM
