paper-with-me

홈 › Papers

Adaptive-lambda Subtracted Importance Sampled Scores in Machine Unlearning for DDPMs and VAEs

2025-11-30 · MohammadParsa Dini, Human Jafari arxiv

Machine Unlearning is essential for large generative models (VAEs, DDPMs) to comply with the right to be forgotten and prevent undesired content generation without costly retraining. Existing approaches, such as Static-lambda SISS for diffusion models, rely on a fixed mixing weight lambda, which is suboptimal because the required unlearning strength varies across samples and training stages. We propose Adaptive-lambda SISS, a principled extension that turns lambda into a latent variable dynamically inferred at each training step. A lightweight inference network parameterizes an adaptive posterior over lambda, conditioned on contextual features derived from the instantaneous SISS loss terms (retain/forget losses and their gradients). This enables joint optimization of the diffusion model and the lambda-inference mechanism via a variational objective, yielding significantly better trade-offs. We further extend the adaptive-lambda principle to score-based unlearning and introduce a multi-class variant of Score Forgetting Distillation. In addition, we present two new directions: (i) a hybrid objective combining the data-free efficiency of Score Forgetting Distillation with the direct gradient control of SISS, and (ii) a Reinforcement Learning formulation that treats unlearning as a sequential decision process, learning an optimal policy over a state space defined by the model's current memory of the forget set. Experiments on an augmented MNIST benchmark show that Adaptive-lambda SISS substantially outperforms the original static-lambda SISS, achieving stronger removal of forgotten classes while better preserving generation quality on the retain set.

📄 PDF Abstract BibTeX arXiv:2512.01054

Code (0)

등록된 구현이 없습니다.

Tasks

Reinforcement Learning

Similar Papers 제목 키워드 기반

An Adaptive Clipping Approach for Proximal Policy Optimization

2018-04-17 · Gang Chen, Yiming Peng, Mengjie Zhang

Very recently proximal policy optimization (PPO) algorithms have been proposed as first-order optimization methods for effective reinforcement learning. While PPO is inspired by the same learning theory that justifies tr…

Learning TheoryReinforcement Learning

Data Unlearning in Diffusion Models

2025-03-02 · Silas Alberti, Kenan Hasanaliyev, Manav Shah, Stefano Ermon

Recent work has shown that diffusion models memorize and reproduce training data examples. At the same time, large copyright lawsuits and legislation such as GDPR have highlighted the need for erasing datapoints from dif…

Machine UnlearningMemorization

Global Convergence of Adaptive Sensing for Principal Eigenvector Estimation

2025-05-16 · Alex Saad-Falcon, Brighton Ancelin, Justin Romberg

This paper addresses the challenge of efficient principal component analysis (PCA) in high-dimensional spaces by analyzing a compressively sampled variant of Oja's algorithm with adaptive sensing. Traditional PCA methods…

AGMixup: Adaptive Graph Mixup for Semi-supervised Node Classification

2024-12-11 · Weigang Lu, Ziyu Guan, Wei Zhao, Yaming Yang 외

Mixup is a data augmentation technique that enhances model generalization by interpolating between data points using a mixing ratio $\lambda$ in the image domain. Recently, the concept of mixup has been adapted to the gr…

Data AugmentationNode Classification

Off-policy Distributional Q($λ$): Distributional RL without Importance Sampling

2024-02-08 · Yunhao Tang, Mark Rowland, Rémi Munos, Bernardo Ávila Pires 외

We introduce off-policy distributional Q($\lambda$), a new addition to the family of off-policy distributional evaluation algorithms. Off-policy distributional Q($\lambda$) does not apply importance sampling for off-poli…