Memory-Efficient Distributed Unlearning

Machine unlearning considers the removal of the contribution of a set of data points from a trained model, and is often associated with realizing “the right to be forgotten”. In distributed settings, where a server orchestrates training using data available at a set of remote users, unlearning is essential to cope with malicious or corrupted clients. If these are revealed after training is concluded, and the collaborating users are no longer available, unlearning has to be completed solely by the server. Consequently, server-side unlearning conventionally requires 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 proposememory-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 analyze MEDU, deriving an upper bound on the difference between the desired model that is trained from scratch and the model unlearned from lossy compressed stored updates. Our bound outperforms the state-of-the-art known bounds for non-compressed decentralized server-side unlearning, even when lossy compression is incorporated. We further provide a numerical study, which shows that suited lossy compression can enable distributed unlearning with notably reduced memory footprint at the server while maintaining the utility of the unlearned model.