mlsanityData to 14 Oct 2026

Recommendation Unlearning via Matrix Correction

arXiv 2307.15960 ↗First posted 29 Jul 2023cs.IR cs.LGcited by 6

Not on the map. Why?

Abstract (arXiv)

Recommender systems are important for providing personalized services to users, but the vast amount of collected user data has raised concerns about privacy (e.g., sensitive data), security (e.g., malicious data) and utility (e.g., toxic data). To address these challenges, recommendation unlearning has emerged as a promising approach, which allows specific data and models to be forgotten, mitigating the risks of sensitive/malicious/toxic user data. However, existing methods often struggle to balance completeness, utility, and efficiency, i.e., compromising one for the other, leading to suboptimal recommendation unlearning. In this paper, we propose an Interaction and Mapping Matrices Correction (IMCorrect) method for recommendation unlearning. Firstly, we reveal that many collaborative filtering (CF) algorithms can be formulated as mapping-based approach, in which the recommendation results can be obtained by multiplying the user-item interaction matrix with a mapping matrix. Then, IMCorrect can achieve efficient recommendation unlearning by correcting the interaction matrix and enhance the completeness and utility by correcting the mapping matrix, all without costly model retraining. Unlike existing methods, IMCorrect is a whitebox model that offers greater flexibility in handling various recommendation unlearning scenarios. Additionally, it has the unique capability of incrementally learning from new data, which further enhances its practicality. We conducted comprehensive experiments to validate the effectiveness of IMCorrect and the results demonstrate that IMCorrect is superior in completeness, utility, and efficiency, and is applicable in many recommendation unlearning scenarios.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 47 of its 82 references that are in the map. First posted on arXiv 29 Jul 2023.

Builds on

47 of 82 references.

References · 47

  1. 2016Membership Inference Attacks against Machine Learning Modelscited by 2,281
  2. 2020Extracting Training Data from Large Language Modelscited by 2,189
  3. 2017Understanding Black-box Predictions via Influence Functionscited by 1,741
  4. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  5. 2017Neural Collaborative Filteringcited by 1,111
  6. 2019Machine Unlearningcited by 1,061
  7. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 864
  8. 2019Neural Graph Collaborative Filteringcited by 661
  9. 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
  10. 2019Certified Data Removal from Machine Learning Modelscited by 535
  11. 2018ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Modelscited by 498
  12. 2019Making AI Forget You: Data Deletion in Machine Learningcited by 465
35 more
  1. 2021Remember What You Want to Forget: Algorithms for Machine Unlearningcited by 371
  2. 2020Descent-to-Delete: Gradient-Based Methods for Machine Unlearningcited by 311
  3. 2020Approximate Data Deletion from Machine Learning Modelscited by 255
  4. 2018Manipulating Machine Learning: Poisoning Attacks and Countermeasures for Regression Learningcited by 225
  5. 2020Forgetting Outside the Box: Scrubbing Deep Networks of Information Accessible from Input-Output Observationscited by 180
  6. 2015VBPR: Visual Bayesian Personalized Ranking from Implicit Feedbackcited by 151
  7. 2020DeltaGrad: Rapid retraining of machine learning modelscited by 149
  8. 2019On the Accuracy of Influence Functions for Measuring Group Effectscited by 147
  9. 2021Graph Unlearningcited by 138
  10. 2020Machine Unlearning: Linear Filtration for Logit-based Classifierscited by 95
  11. 2019Embarrassingly Shallow Autoencoders for Sparse Datacited by 94
  12. 2019Analyzing Information Leakage of Updates to Natural Language Modelscited by 90
  13. 2022Deep Unlearning via Randomized Conditionally Independent Hessianscited by 84
  14. 2016Data Poisoning Attacks on Factorization-Based Collaborative Filteringcited by 83
  15. 2022Recommendation Unlearningcited by 80
  16. 2019On Second-Order Group Influence Functions for Black-Box Predictionscited by 79
  17. 2020Influence Function based Data Poisoning Attacks to Top-N Recommender Systemscited by 63
  18. 2022PUMA: Performance Unchanged Model Augmentation for Training Data Removalcited by 58
  19. 2021Membership Inference Attacks Against Recommender Systemscited by 57
  20. 2022BARS: Towards Open Benchmarking for Recommender Systemscited by 54
  21. 2021How Powerful is Graph Convolution for Recommendation?cited by 50
  22. 2022Federated Unlearning for On-Device Recommendationcited by 43
  23. 2021Certifiable Machine Unlearning for Linear Modelscited by 42
  24. 2020Practical Data Poisoning Attack against Next-Item Recommendationcited by 29
  25. 2022Making Recommender Systems Forget: Learning and Unlearning for Erasable Recommendationcited by 29
  26. 2023Personalized Graph Signal Processing for Collaborative Filteringcited by 29
  27. 2023Selective and Collaborative Influence Function for Efficient Recommendation Unlearningcited by 26
  28. 2023Recommendation Unlearning via Influence Functioncited by 22
  29. 2021DeepObliviate: A Powerful Charm for Erasing Data Residual Memory in Deep Neural Networkscited by 19
  30. 2018Explaining Latent Factor Models for Recommendation with Influence Functionscited by 14
  31. 2022Parameter-free Dynamic Graph Embedding for Link Predictioncited by 12
  32. 2023Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendationscited by 12
  33. 2023Triple Structural Information Modelling for Accurate, Explainable and Interactive Recommendationcited by 12
  34. 2019Characterizing Membership Privacy in Stochastic Gradient Langevin Dynamicscited by 8
  35. 2022Forgetting Fast in Recommender Systemscited by 6

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 1; 2024: 3; 2025: 0; 2026: 2.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2024CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence
  2. 2024Multi-Modal Recommendation Unlearning for Legal, Licensing, and Modality Constraints
  3. 2023Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems
  4. 2025Pre-training for Recommendation Unlearning
  5. 2025LEGO: A Lightweight and Efficient Multiple-Attribute Unlearning Framework for Recommender Systems
  6. 2023On the Effectiveness of Unlearning in Session-Based Recommendation
  7. 2025Learning to Fast Unrank in Collaborative Filtering Recommendation
  8. 2025Reproducibility Companion Paper: Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems