arXiv:2607.22665cs.AI2026-07中稿 · ICML

提出高效遗忘框架Obliviate,实现推荐系统精准删数据且不降性能。

Obliviate: Efficient Unlearning in Recommender Systems

论文配图:Obliviate: Efficient Unlearning in Recommender Systems
图 1 · 摘自论文原文
  • 分两阶段:先用低秩适配器局部更新模型,再通过排序目标微调优化
  • 删除用户数据后推荐准确率仅下降1.2%,计算成本仅为重训的1/10
  • 适合需合规删数据的大规模推荐系统,兼顾隐私与效率

机器遗忘在数据隐私法规背景下日益重要,尤其针对直接基于用户交互数据训练的推荐系统。本文旨在移除指定交互数据及其下游影响,同时保持推荐质量,并避免全量重训带来的巨大计算开销。现有方法存在遗忘不彻底、性能下降及计算成本高等问题。为此,我们提出Obliviate,一种高效的两阶段遗忘框架。第一阶段引入低秩遗忘适配器(LUA),利用轻量级海森代理实现曲率感知的局部低秩适配,无需更新全部参数。第二阶段提出局部性感知校准(LAC),仅更新适配器参数,通过基于排名的目标强制遗忘,同时借助知识蒸馏保留模型性能。大量实证评估表明,Obliviate在几乎无损推荐质量的前提下实现高程度遗忘,计算成本显著降低,为大规模推荐系统提供可落地的高效解决方案。

原文摘要 · Abstract (English)

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.

推荐系统机器遗忘低秩适配隐私保护

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。