Cited by 115Privacy-Preserving Technologies in DataRecommender Systems and TechniquesPrivacy, Security, and Data Protection

Recommendation Unlearning

Open access
Chen, Chong, Sun, Fei, Zhang, Min, Ding, Bolin·2022·Proceedings of the ACM Web Conference 2022

Abstract

Recommender systems provide essential web services by learning users’ personal preferences from collected data. However, in many cases, systems also need to forget some training data. From the perspective of privacy, users desire a tool to erase the impacts of their sensitive data from the trained models. From the perspective of utility, if a system’s utility is damaged by some bad data, the system needs to forget such data to regain utility. While unlearning is very important, it has not been well-considered in existing recommender systems. Although there are some researches have studied the problem of machine unlearning, existing methods can not be directly applied to recommendation as they are unable to consider the collaborative information.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3485447.3511997

Cites

42 of 42 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The unlearning schemes proposed in References [29, 30, 33, 47, 68, 69] are essentially based on a retraining mechanism that naturally has a verifiability property.

    “The unlearning schemes proposed in References [29, 30, 33, 47, 68, 69] are essentially based on a retraining mechanism that naturally has a verifiability property.”

    From Machine Unlearning: A Survey (2024) · cites this paper as [33]

    Section 4.1 (page unavailable) says RecEraser unlearns data by retraining the affected submodel and aggregation component. The discussion of exact unlearning says its aim is complete removal of the requested data, but our copy does not say that this retraining mechanism naturally has a verifiability property. (LLM, conf=0.83)

    Experimental — accuracy not yet measured
  • Machine unlearning has played an essential role in many applications.

    “Machine unlearning has played an essential role in many applications [33, 34].”

    From Machine Unlearning: A Survey (2024) · cites this paper as [33]

  • The above unlearning schemes usually need to cache a large number of intermediate results to complete the unlearning process, which consumes a lot of storage space.

    “Nevertheless, the above unlearning schemes [30, 33, 69] usually need to cache a large number of intermediate results to complete the unlearning process. This will consume a lot of storage space.”

    From Machine Unlearning: A Survey (2024) · cites this paper as [33]

    Section 4.1 describes retraining an affected submodel and the aggregation component; Section 5.3 discusses running-time efficiency. Neither addresses caching intermediate results or storage consumption. Searches for caching, checkpoints, and storage overhead found no passage supporting that claim. (LLM, conf=0.74)

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 15

  1. Nicholas Carlini, Florian Tramèr, Eric Wallace, Matthew Jagielski, Ariel Herbert- Voss, Katherine Lee, Adam Roberts, Tom Brown, Dawn Song, Úlfar Erlingsson, Alina Oprea, and Colin Raffel. 2021. Extracting Training Data from Large Lan- guage Models. (Aug. 2021), 2633-2650. https://www.usenix.org/conference/ usenixsecurity21/presentation/carlini-extracting
  2. Gert Cauwenberghs and Tomaso Poggio. 2001. Incremental and Decremental Support Vector Machine Learning. In Advances in Neural Information Processing Systems, Vol. 13. MIT Press, 388-394.
  3. Minjin Choi, Yoonki Jeong, Joonseok Lee, and Jongwuk Lee. 2021. Local Collabo- rative Autoencoders. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining. New York, NY, USA, 734-742.
  4. Cynthia Dwork, Aaron Roth, et al. 2014. The algorithmic foundations of differ- ential privacy. Found. Trends Theor. Comput. Sci. 9, 3-4 (2014), 211-407.
  5. Chen Gao, Chao Huang, Dongsheng Lin, Depeng Jin, and Yong Li. 2020. DPLCF: Differentially Private Local Collaborative Filtering. In Proceedings of the 43rd International ACM SIGIR Conference on Research and Development in Information Retrieval. 961-970.
  6. Antonio Ginart, Melody Guan, Gregory Valiant, and James Y Zou. 2019. Mak- ing AI Forget You: Data Deletion in Machine Learning. In Advances in Neural Information Processing Systems, Vol. 32. Curran Associates, Inc.
  7. Chuan Guo, Tom Goldstein, Awni Hannun, and Laurens Van Der Maaten. 2020. Certified Data Removal from Machine Learning Models. In Proceedings of the 37th International Conference on Machine Learning (Proceedings of Machine Learning Research, Vol. 119), Hal Daumé III and Aarti Singh (Eds.). PMLR, 3832-3842.
  8. Xiangnan He, Kuan Deng, Xiang Wang, Yan Li, YongDong Zhang, and Meng Wang. 2020. LightGCN: Simplifying and Powering Graph Convolution Network for Recommendation. In Proceedings of the 43rd International ACM SIGIR Confer- ence on Research and Development in Information Retrieval (Virtual Event, China). Association for Computing Machinery, New York, NY, USA, 639-648.
  9. Zachary Izzo, Mary Anne Smart, Kamalika Chaudhuri, and James Zou. 2021. Ap- proximate Data Deletion from Machine Learning Models. In The 24th International Conference on Artificial Intelligence and Statistics, Vol. 130. PMLR, 2008-2016.
  10. Masayuki Karasuyama and Ichiro Takeuchi. 2009. Multiple Incremental Decre- mental Learning of Support Vector Machines. In Advances in Neural Information Processing Systems, Vol. 22. Curran Associates, Inc.
  11. Fuyu Lv, Taiwei Jin, Changlong Yu, Fei Sun, Quan Lin, Keping Yang, and Wil- fred Ng. 2019. SDM: Sequential Deep Matching Model for Online Large-Scale Recommender System. In Proceedings of the 28th ACM International Conference on Information and Knowledge Management (Beijing, China). Association for Computing Machinery, New York, NY, USA, 2635-2643.
  12. Vinod Nair and Geoffrey E. Hinton. 2010. Rectified Linear Units Improve Re- stricted Boltzmann Machines. In Proceedings of the 27th International Conference on International Conference on Machine Learning (Haifa, Israel) (ICML'10). Omni- press, Madison, WI, USA, 807-814.
  13. Seth Neel, Aaron Roth, and Saeed Sharifi-Malvajerdi. 2021. Descent-to-Delete: Gradient-Based Methods for Machine Unlearning. In Proceedings of 32nd Interna- tional Conference on Algorithmic Learning Theory, Vol. 132. PMLR, 931-962.
  14. Steffen Rendle, Christoph Freudenthaler, Zeno Gantner, and Lars Schmidt-Thieme. 2009. BPR: Bayesian Personalized Ranking from Implicit Feedback. In Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence (Montreal, Quebec, Canada). AUAI Press, Arlington, Virginia, USA, 452-461.
  15. Sebastian Schelter. 2020. "Amnesia" -Machine Learning Models That Can For- get User Data Very Fast. In Workshop on Applied AI for Database Systems and Applications (AIDB) at VLDB.

Cited by

Sorted by citations

Authors
Chen, C., Sun, F., Zhang, M., & Ding, B.
Affiliations
  • Tsinghua University (CN)
  • Alibaba Group (China) (CN)
  • Alibaba Group (United States) (US)
Venue
Proceedings of the ACM Web Conference 2022
Publisher
ACM
Published
2022-04-25
Pages
2768-2777
OpenAlex
W4224325687
Cited by
110
References
40
Citations by year
2026: 22 · 2025: 42 · 2024: 25 · 2023: 19 · 2022: 2
FWCI
12.13
Type
conference paper
Language
en
Open access
Locations
  • International World Wide Web Conference (WWW) (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
  • National Natural Science Foundation of China (U21B2026)
  • Tsinghua University
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Privacy-Preserving Technologies in Data
  • Physical Sciences › Computer Science › Information Systems › Recommender Systems and Techniques
  • Social Sciences › Sociology and Political Science › Privacy, Security, and Data Protection
Keywords
recommender systems, machine unlearning, data deletion, privacy, collaborative filtering, sensitive data

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review