Obliviate: Efficient Unlearning in Recommender Systems
On the map: LLM safety and security → Membership inference attacks
Abstract (arXiv)
Machine unlearning is becoming increasingly critical in the context of data privacy regulations, particularly for recommendation systems that are directly trained on user interaction data. The goal of this work is to remove requested interaction data and their downstream influence from trained model while preserving recommendation quality, and to do so without incurring the substantial computational cost of full retraining. Existing approaches exhibit several limitations, including limited unlearning completeness and degradation in recommendation performance, while having substantial computational overhead. In this paper, we propose Obliviate, an efficient two-stage unlearning framework for recommender systems that achieves high unlearning completeness while maintaining good utility. In the first stage, we introduce a Low-Rank Unlearning Adapter (LUA), which employs a lightweight Hessian proxy to enable curvature-aware and efficient unlearning through localized low-rank adapters rather than full parameters. In the second stage, we propose Locality-Aware Calibration (LAC), a lightweight refinement stage that updates only the adapter parameters to improve the performance by enforcing unlearning via ranking-based objectives while preserving utility through knowledge distillation. Extensive empirical evaluations demonstrate that Obliviate achieves high level of forgetting with minimal loss in recommendation quality and at significantly reduced computational cost, offering a practical and scalable solution for large-scale recommender systems.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Membership inference attacks, one of 12 directions in LLM safety and security. Builds on 23 of its 41 references that are in the map. First posted on arXiv 30 Jun 2026.
Builds on
23 of 41 references.
Closest ancestors · 2
Same direction, newest first
- 2024CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence26 Aug
- 2023Netflix and Forget: Efficient and Exact Machine Unlearning from Bi-linear Recommendations13 Feb
Other references · 21
- 2017Understanding Black-box Predictions via Influence Functionscited by 1,714
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2017Neural Collaborative Filteringcited by 1,108
- 2019Machine Unlearningcited by 1,020
- 2019Neural Graph Collaborative Filteringcited by 660
- 2023A Comprehensive Overview of Large Language Modelscited by 639
- 2022A Survey of Machine Unlearningcited by 298
- 2017How to Escape Saddle Points Efficientlycited by 284
- 2024What makes unlearning hard and what to do about itcited by 89
- 2022Recommendation Unlearningcited by 71
- 2024Datasets for Large Language Models: A Comprehensive Surveycited by 69
9 more
- 2023Selective and Collaborative Influence Function for Efficient Recommendation Unlearningcited by 25
- 2023Recommendation Unlearning via Influence Functioncited by 21
- 2018Piecewise Strong Convexity of Neural Networkscited by 13
- 2022Forgetting Fast in Recommender Systemscited by 6
- 2023Recommendation Unlearning via Matrix Correctioncited by 6
- 2022Contemporary Recommendation Systems on Big Data and Their Applications: A Surveycited by 5
- 2024On Newton's Method to Unlearn Neural Networkscited by 5
- 2021Local Strong Convexity of Source Localization and Error Bound for Target Tracking under Time-of-Arrival Measurementscited by 3
- 2023Generalized Low-Rank Update: Model Parameter Bounds for Low-Rank Training Data Modificationscited by 3
Built on by
Not cited yet.