mlsanityData to 7 Oct 2026

Recommendation Unlearning via Influence Function

arXiv 2307.02147 ↗First posted 5 Jul 2023cs.IRcited by 21

Not on the map. Why?

Abstract (arXiv)

Recommendation unlearning is an emerging task to serve users for erasing unusable data (e.g., some historical behaviors) from a well-trained recommender model. Existing methods process unlearning requests by fully or partially retraining the model after removing the unusable data. However, these methods are impractical due to the high computation cost of full retraining and the highly possible performance damage of partial training. In this light, a desired recommendation unlearning method should obtain a similar model as full retraining in a more efficient manner, i.e., achieving complete, efficient and harmless unlearning. In this work, we propose a new Influence Function-based Recommendation Unlearning (IFRU) framework, which efficiently updates the model without retraining by estimating the influence of the unusable data on the model via the influence function. In the light that recent recommender models use historical data for both the constructions of the optimization loss and the computational graph (e.g., neighborhood aggregation), IFRU jointly estimates the direct influence of unusable data on optimization loss and the spillover influence on the computational graph to pursue complete unlearning. Furthermore, we propose an importance-based pruning algorithm to reduce the cost of the influence function. IFRU is harmless and applicable to mainstream differentiable models. Extensive experiments demonstrate that IFRU achieves more than 250 times acceleration compared to retraining-based methods with recommendation performance comparable to full retraining. Codes are avaiable at https://github.com/baiyimeng/IFRU.

Key facts. Cited by 21 papers in the map (data through 7 Oct 2026). First posted on arXiv 5 Jul 2023.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 2; 2024: 6; 2025: 10; 2026: 3.

21 papers.

Sort:

By area:

  1. 2024Towards Efficient and Effective Unlearning of Large Language Models for Recommendationcited by 16
  2. 2024Dynamic Graph Unlearning: A General and Efficient Post-Processing Method via Gradient Transformationcited by 15
  3. 2023A Survey of Graph Unlearningcited by 12
  4. 2024Machine Unlearning for Recommendation Systems: An Insightcited by 9
  5. 2024A Survey on Recommendation Unlearning: Fundamentals, Taxonomy, Evaluation, and Open Questionscited by 7
  6. 2023Recommendation Unlearning via Matrix Correctioncited by 6
  7. 2024CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influencecited by 6
  8. 2025IGD: Token Decisiveness Modeling via Information Gain in LLMs for Personalized Recommendationcited by 5
  9. 2025Unlearning Inversion Attacks for Graph Neural Networkscited by 4
  10. 2025Exploring Incremental Unlearning: Techniques, Challenges, and Future Directionscited by 2
  11. 2025Influence Functions for Edge Edits in Non-Convex Graph Neural Networkscited by 2
  12. 2025Train Once, Forget Precisely: Anchored Optimization for Efficient Post-Hoc Unlearningcited by 2
9 more
  1. 2024Towards Independence Criterion in Machine Unlearning of Features and Labelscited by 1
  2. 2025TAIJI: MCP-based Multi-Modal Data Analytics on Data Lakescited by 1
  3. 2025Customized Retrieval-Augmented Generation with LLM for Debiasing Recommendation Unlearningcited by 1
  4. 2025Soft Weighted Machine Unlearningcited by 0
  5. 2025Pre-training for Recommendation Unlearningcited by 0
  6. 2025LEGO: A Lightweight and Efficient Multiple-Attribute Unlearning Framework for Recommender Systemscited by 0
  7. 2026TRU: Targeted Reverse Update for Efficient Multimodal Recommendation Unlearningcited by 0
  8. 2026Obliviate: Efficient Unlearning in Recommender Systemscited by 0
  9. 2026OSR: Output Space Redistribution for Adaptive Label Removal in Classification Modelscited by 0