LEGO: A Lightweight and Efficient Multiple-Attribute Unlearning Framework for Recommender Systems
On the map: LLM safety and security → Membership inference attacks
Abstract (arXiv)
With the growing demand for safeguarding sensitive user information in recommender systems, recommendation attribute unlearning is receiving increasing attention. Existing studies predominantly focus on single-attribute unlearning. However, privacy protection requirements in the real world often involve multiple sensitive attributes and are dynamic. Existing single-attribute unlearning methods cannot meet these real-world requirements due to i) CH1: the inability to handle multiple unlearning requests simultaneously, and ii) CH2: the lack of efficient adaptability to dynamic unlearning needs. To address these challenges, we propose LEGO, a lightweight and efficient multiple-attribute unlearning framework. Specifically, we divide the multiple-attribute unlearning process into two steps: i) Embedding Calibration removes information related to a specific attribute from user embedding, and ii) Flexible Combination combines these embeddings into a single embedding, protecting all sensitive attributes. We frame the unlearning process as a mutual information minimization problem, providing LEGO a theoretical guarantee of simultaneous unlearning, thereby addressing CH1. With the two-step framework, where Embedding Calibration can be performed in parallel and Flexible Combination is flexible and efficient, we address CH2. Extensive experiments on three real-world datasets across three representative recommendation models demonstrate the effectiveness and efficiency of our proposed framework. Our code and appendix are available at https://github.com/anonymifish/lego-rec-multiple-attribute-unlearning.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Membership inference attacks, one of 12 directions in LLM safety and security. Builds on 24 of its 51 references that are in the map. First posted on arXiv 23 Oct 2025.
Builds on
24 of 51 references.
Closest ancestors · 5
Same direction, newest first
- 2024Simultaneous Unlearning of Multiple Protected User Attributes From Variational Autoencoder Recommenders Using Adversarial Training28 Oct
- 2024CURE4Rec: A Benchmark for Recommendation Unlearning with Deeper Influence26 Aug
- 2023Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems6 Oct
- 2022Unlearning Protected User Attributes in Recommendations with Adversarial Training9 Jun
- 2022Making Recommender Systems Forget: Learning and Unlearning for Erasable Recommendation22 Mar
Other references · 19
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2019Machine Unlearningcited by 1,061
- 2019Eternal Sunshine of the Spotless Net: Selective Forgetting in Deep Networkscited by 618
- 2019Certified Data Removal from Machine Learning Modelscited by 535
- 2018ML-Leaks: Model and Data Independent Membership Inference Attacks and Defenses on Machine Learning Modelscited by 498
- 2021Remember What You Want to Forget: Algorithms for Machine Unlearningcited by 371
- 2018Variational Autoencoders for Collaborative Filteringcited by 310
- 2021Machine Unlearning of Features and Labelscited by 229
- 2018AttriGuard: A Practical Defense Against Attribute Inference Attacks via Adversarial Machine Learningcited by 60
- 2021Graph Embedding for Recommendation against Attribute Inference Attackscited by 40
- 2020Joint Item Recommendation and Attribute Inference: An Adaptive Graph Convolutional Network Approachcited by 30
- 2023Selective and Collaborative Influence Function for Efficient Recommendation Unlearningcited by 26
7 more
- 2024Post-Training Attribute Unlearning in Recommender Systemscited by 24
- 2023Recommendation Unlearning via Influence Functioncited by 22
- 2019Privacy-Aware Recommendation with Private-Attribute Protection using Adversarial Learningcited by 21
- 2025Evaluating Supervised Learning Models for Fraud Detection: A Comparative Study of Classical and Deep Architectures on Imbalanced Transaction Datacited by 20
- 2022Efficient Attribute Unlearning: Towards Selective Removal of Input Attributes from Feature Representationscited by 17
- 2023KuaiSAR: A Unified Search And Recommendation Datasetcited by 15
- 2025Gated Multimodal Graph Learning for Personalized Recommendationcited by 15
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2022Recommendation Unlearning
- 2024A Survey on Recommendation Unlearning: Fundamentals, Taxonomy, Evaluation, and Open Questions
- 2024Machine Unlearning for Recommendation Systems: An Insight
- 2026Obliviate: Efficient Unlearning in Recommender Systems
- 2025Customized Retrieval-Augmented Generation with LLM for Debiasing Recommendation Unlearning
- 2025Reproducibility Companion Paper: Making Users Indistinguishable: Attribute-wise Unlearning in Recommender Systems
- 2025Learning to Fast Unrank in Collaborative Filtering Recommendation
- 2025Pre-training for Recommendation Unlearning