不重训模型,用校验机制在推理时删除数据记忆。
Inference-time Unlearning Using Conformal Prediction
- 用置信度校验器在生成时判断是否符合遗忘要求。
- 无需更新参数,推理误差降低93%。
- 适合需快速删除数据的生成模型应用。
机器遗忘是指在不从头训练的情况下,高效移除已训练模型中的特定信息。现有方法通常依赖基于遗忘数据集的参数子集重训练,并提供可证明的保证,但在实际场景中,特别是生成模型中,其假设常被挑战。此外,这类方法往往损害模型预训练获得的通用能力。为此,本文提出推理时遗忘范式:让生成模型配备一个(近似正确)的验证器,判断输出是否满足遗忘要求。该框架通过验证器反馈迭代优化生成结果,而不更新模型参数。利用置信区间预测,该方法降低计算开销并提供无分布假设的遗忘保证。实验表明,该方法在多个挑战性基准上将遗忘误差降低高达93%。
原文摘要 · Abstract (English)
Machine unlearning is the process of efficiently removing specific information from a trained machine learning model without retraining from scratch. Existing unlearning methods, which often provide provable guarantees, typically involve retraining a subset of model parameters based on a forget set. While these approaches show promise in certain scenarios, their underlying assumptions are often challenged in real-world applications -- particularly when applied to generative models. Furthermore, updating parameters using these unlearning procedures often degrades the general-purpose capabilities the model acquired during pre-training. Motivated by these shortcomings, this paper considers the paradigm of inference time unlearning -- wherein, the generative model is equipped with an (approximately correct) verifier that judges whether the model's response satisfies appropriate unlearning guarantees. This paper introduces a framework that iteratively refines the quality of the generated responses using feedback from the verifier without updating the model parameters. The proposed framework leverages conformal prediction to reduce computational overhead and provide distribution-free unlearning guarantees. This paper's approach significantly outperforms existing state-of-the-art methods, reducing unlearning error by up to 93% across challenging unlearning benchmarks.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。