Memory-Efficient Distributed Unlearning
Natalie Lang, Alon Helvitz, and Nir Shlezinger

TL;DR
This paper introduces MEDU, a memory-efficient distributed unlearning scheme using lossy compression techniques to reduce storage needs while maintaining model accuracy after unlearning.
Contribution
The paper proposes MEDU, a hierarchical lossy compression method for distributed unlearning, with theoretical guarantees and practical benefits over existing approaches.
Findings
MEDU significantly reduces server memory footprint.
Theoretical bounds outperform existing non-compressed methods.
Numerical results show maintained model utility with compression.
Abstract
Machine unlearning considers the removal of the contribution of a set of data points from a trained model. In a distributed setting, where a server orchestrates training using data available at a set of remote users, unlearning is essential to cope with late-detected malicious or corrupted users. Existing distributed unlearning algorithms require the server to store all model updates observed in training, leading to immense storage overhead for preserving the ability to unlearn. In this work we study lossy compression schemes for facilitating distributed server-side unlearning with limited memory footprint. We propose memory-efficient distributed unlearning (MEDU), a hierarchical lossy compression scheme tailored for server-side unlearning, that integrates user sparsification, differential thresholding, and random lattice coding, to substantially reduce memory footprint. We rigorously…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications
MethodsSparse Evolutionary Training
