RRL: Recommendation Reverse Learning
Xiaoyu You, Jianwei Xu, Mi Zhang, Zechen Gao, Min Yang
Abstract
As societies become increasingly aware of data privacy, regulations require that private information about users must be removed from both database and ML models, which is more colloquially called the right to be forgotten. Such privacy problems of recommendation systems, which hold large amounts of private data, are drawing increasing attention. Recent research suggests dividing the preference data into multiple shards and training submodels with these shards and forgetting users' personal preference data by retraining the submodels of marked shards. Despite the computational efficiency development compared with retraining from scratch, the overall recommendation performance deteriorates after dividing the shards because the collaborative information contained in the training data is broken. In this paper, we aim to propose a forgetting framework for recommendation models that neither separate the training data nor jeopardizes the recommendation performance, named Recommendation Reverse Learning (RRL). Given the trained recommendation model and marked preference data, we devise Reverse BPR Objective (RBPR Objective) to fine-tune the recommendation model to force it to forget the marked data. Nevertheless, as the recommendation model encode the complex collaborative information among users, we propose to utilize Fisher Information Matrix (FIM) to estimate the influence of reverse learning on other users' collaborative information and guide the updates of representations. We conduct experiments on two representative recommendation models and three public benchmark datasets to verify the efficiency of RRL. To verify the forgetting completeness, we use RRL to make the recommendation model poisoned by shilling attacks forget malicious users.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 63f2a24a-1d78-4b3e-abf1-288abe32fc50Cited by top-tier papers3
- Multi-Modal Recommendation Unlearning for Legal, Licensing, and Modality ConstraintsYash Sinha, Murari Mandal, Mohan S. KankanhalliAAAI 2025 · 5 citations
- Unbiased Rectification for Sequential Recommender Systems Under Fake OrdersQiyu Qin, Yichen Li, Haozhao Wang, Cheng Wang et al.AAAI 2026
- Obliviate: Efficient Unlearning in Recommender SystemsTushar Prakash, Brijraj Singh, Niranjan Pedanekar, Narayan ChaturvediICML 2026
Builds on17
- Membership Inference Attacks Against Machine Learning ModelsReza Shokri, Marco Stronati, Congzheng Song, Vitaly ShmatikovS&P 2017 · 5,137 citations
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 · 4,448 citations
- Self-supervised Graph Learning for RecommendationJiancan Wu, Xiang Wang, Fuli Feng, Xiangnan He et al.SIGIR 2021 · 1,476 citations
- Machine UnlearningLucas Bourtoule, Varun Chandrasekaran, Christopher A. Choquette-Choo, Hengrui Jia et al.S&P 2021 · 1,381 citations
- Revisiting Graph Based Collaborative Filtering: A Linear Residual Graph Convolutional Network ApproachLei Chen, Le Wu, Richang Hong, Kun Zhang et al.AAAI 2020 · 634 citations
Related papers
- Recommendation UnlearningChong Chen, Fei Sun, Min Zhang, Bolin DingWWW 2022 · 146 citations
- UltraRE: Enhancing RecEraser for Recommendation Unlearning via Error DecompositionYuyuan Li, Chaochao Chen, Yizhao Zhang, Weiming Liu et al.NeurIPS 2023 · 90 citations
- DA2-Unlearn: Dual-Adaptive Forget-Repair-Based Recommendation UnlearningHaocheng Dou, Tao Lian, Xuemeng Song, Pengjie RenKDD 2026
- Towards Safe Machine Unlearning: A Paradigm that Mitigates Performance DegradationShanshan Ye, Jie Lu, Guangquan ZhangWWW 2025 · 13 citations
- Machine Unlearning in Gradient Boosting Decision TreesHuawei Lin, Jun Woo Chung, Yingjie Lao, Weijie ZhaoKDD 2023 · 13 citations
