提出统一框架,让扩散模型高效删去特定数据或概念而不破坏原有功能。
Unlearning in Diffusion Models: A Unified Framework with KL Divergence and Likelihood Constraints

- 基于KL散度和似然约束构建优化框架,实现可控删减。
- 相比基线方法,在保留能力与删除效果间取得更好平衡。
- 适用于需精准删除数据或概念的场景,如隐私保护、内容安全。
扩散模型中的去学习旨在移除不良数据或概念,同时保持预训练模型的可用性——这两大目标本质冲突。本文提出一种基于约束优化的严谨框架,将去学习定义为在远离预训练模型偏差的同时,满足与被删除分布的显式分离约束。具体提出三种基于反向/前向KL散度及似然约束的优化问题:前两种推广了现有概念与数据去学习方法,第三种则提供一种新颖自然的去学习形式。尽管KL约束具有非凸性,我们仍证明三类问题均存在强对偶性,可显式刻画最优解并设计对应原-对偶算法。实验表明,所提KL约束方法在概念与数据去学习任务中均优于基于权重的基线方法,展现出更优的保留-删除权衡;而基于似然的方法在去学习效果相当的前提下,显著更好地保留了原有概念。
原文摘要 · Abstract (English)
Unlearning in diffusion models aims to remove undesirable data or concepts while preserving the utility of pretrained models -- two fundamentally conflicting objectives. We propose a principled constrained optimization framework that formulates unlearning as minimizing the deviation from a pretrained model, subject to explicit separation constraints from the unlearning distributions. Specifically, we formulate three constrained optimization problems based on reverse and forward KL divergences, and likelihood constraints. The first two generalize existing approaches for concept and data unlearning, while the third offers a novel and natural formulation for unlearning. Despite the nonconvexity of the KL constraints, we establish strong duality for all three problems, enabling us to explicitly characterize their optimal solutions as unlearning targets and develop primal-dual algorithms for each formulation. Experimental results demonstrate that our KL-constrained approach achieves superior retention-unlearning tradeoffs compared to weight-based baselines for concept and data unlearning, and that our likelihood-based approach matches unlearning effectiveness while better preserving retained concepts compared to baselines.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。