Pith. sign in

REVIEW 1 cited by

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.06676 v1 pith:C2YMCRWE submitted 2023-02-13 cs.LG cs.IR

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

classification cs.LG cs.IR
keywords bi-linearmodelrecommendationswithoutforgetmakingmodelsprocedure
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X LinkedIn Reddit HN
read the original 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.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Obliviate: Efficient Unlearning in Recommender Systems

    cs.AI 2026-06 conditional novelty 6.0

    Obliviate performs recommender unlearning via a low-rank Newton-style downdate with an Adam-based curvature proxy plus a calibration stage, approximating retrained models at lower cost.