Pith. sign in

REVIEW 2 cited by

Recommendation Unlearning via Matrix Correction

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2307.15960 v1 pith:UGUZ2BH4 submitted 2023-07-29 cs.IR cs.LG

Recommendation Unlearning via Matrix Correction

classification cs.IR cs.LG
keywords recommendationdataunlearningimcorrectmatrixutilitycompletenessinteraction
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Recommender systems are important for providing personalized services to users, but the vast amount of collected user data has raised concerns about privacy (e.g., sensitive data), security (e.g., malicious data) and utility (e.g., toxic data). To address these challenges, recommendation unlearning has emerged as a promising approach, which allows specific data and models to be forgotten, mitigating the risks of sensitive/malicious/toxic user data. However, existing methods often struggle to balance completeness, utility, and efficiency, i.e., compromising one for the other, leading to suboptimal recommendation unlearning. In this paper, we propose an Interaction and Mapping Matrices Correction (IMCorrect) method for recommendation unlearning. Firstly, we reveal that many collaborative filtering (CF) algorithms can be formulated as mapping-based approach, in which the recommendation results can be obtained by multiplying the user-item interaction matrix with a mapping matrix. Then, IMCorrect can achieve efficient recommendation unlearning by correcting the interaction matrix and enhance the completeness and utility by correcting the mapping matrix, all without costly model retraining. Unlike existing methods, IMCorrect is a whitebox model that offers greater flexibility in handling various recommendation unlearning scenarios. Additionally, it has the unique capability of incrementally learning from new data, which further enhances its practicality. We conducted comprehensive experiments to validate the effectiveness of IMCorrect and the results demonstrate that IMCorrect is superior in completeness, utility, and efficiency, and is applicable in many recommendation unlearning scenarios.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Obliviate: Efficient Unlearning in Recommender Systems

    cs.AI 2026-06 conditional novelty 6.0

    Obliviate performs recommender unlearning via a low-rank Newton-style downdate with an Adam-based curvature proxy plus a calibration stage, approximating retrained models at lower cost.

  2. From Hidden Profiles to Governable Personalization: Recommender Systems in the Age of LLM Agents

    cs.IR 2026-04 unverdicted novelty 5.0

    LLM agents enable a shift in recommender systems from opaque hidden profiles to governable, inspectable, and portable user representations.