Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations

Mimee Xu, Jiankai Sun, Xin Yang, Kevin Yao, Chong Wang
2/13/2023
cs.LGcs.IR

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

People break up, miscarry, and lose loved ones. Their online streaming and shopping recommendations, however, do not necessarily update, and may serve as unhappy reminders of their loss. When users want to renege on their past actions, they expect the recommender platforms to erase selective data at the model level. Ideally, given any specified user history, the recommender can unwind or "forget", as if the record was not part of training. To that end, this paper focuses on simple but widely deployed bi-linear models for recommendations based on matrix completion. Without incurring the cost of re-training, and without degrading the model unnecessarily, we develop Unlearn-ALS by making a few key modifications to the fine-tuning procedure under Alternating Least Squares optimisation, thus applicable to any bi-linear models regardless of the training procedure. We show that Unlearn-ALS is consistent with retraining without \emph{any} model degradation and exhibits rapid convergence, making it suitable for a large class of existing recommenders.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{xu2023netflix,
  title  = {Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations},
  author = {Mimee Xu and Jiankai Sun and Xin Yang and Kevin Yao and Chong Wang},
  year   = {2023},
  eprint = {2302.06676},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.06676v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2302.06676.svg)](https://codeofpaper.com/paper/2302.06676)

Discussion