通过梯度正交化实现快速生成模型删忆,不重训也能高效清除数据影响。
UNO: Unlearning via Orthogonalization in Generative models
- 用损失梯度正交化方法,快速移除特定数据影响。
- 在多个数据集上实现比前人快数个数量级的删忆速度。
- 适合需要快速删除隐私或有害内容的生成模型应用。
随着生成模型日益强大和普及,根据隐私保护、法律要求或纠正有害内容的需求,能够删去特定数据的能力变得愈发重要。与传统训练中累积数据并强化知识不同,删忆旨在不进行从头训练的情况下,选择性地消除特定数据点的影响。有效的删忆算法需满足:(i) 消除不需要数据的影响,(ii) 保持生成质量,(iii) 保留已有训练数据对模型参数的影响,(iv) 训练步数少。本文提出基于损失梯度正交化的快速删忆算法,适用于无条件和有条件生成模型。实验表明,该算法可在保持原模型保真度的同时实现有效删忆。在标准图像基准(MNIST、CelebA、ImageNet-1K)和复杂度递增的生成模型(VAEs、扩散变换器)上,其删忆速度比前人方法(如梯度手术)快数个数量级。
原文摘要 · Abstract (English)
As generative models become increasingly powerful and pervasive, the ability to unlearn specific data, whether due to privacy concerns, legal requirements, or the correction of harmful content, has become increasingly important. Unlike in conventional training, where data are accumulated and knowledge is reinforced, unlearning aims to selectively remove the influence of particular data points without costly retraining from scratch. To be effective and reliable, such algorithms need to achieve (i) forgetting of the undesired data, (ii) preservation of the quality of the generation, (iii) preservation of the influence of the desired training data on the model parameters, and (iv) small number of training steps. We propose fast unlearning algorithms based on loss gradient orthogonalization for unconditional and conditional generative models. We show that our algorithms are able to forget data while maintaining the fidelity of the original model. On standard image benchmarks, our algorithms achieve orders of magnitude faster unlearning times than their predecessors, such as gradient surgery. We demonstrate our algorithms with datasets of increasing complexity (MNIST, CelebA and ImageNet-1K) and for generative models of increasing complexity (VAEs and diffusion transformers).
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。