arXiv Machine Learning

Mitigating Sequential Reappearance in Diffusion Data-Point Unlearning

The paper introduces a new evaluation protocol for diffusion data‑point unlearning that tracks whether each target is forgotten, remains forgotten, or reappears during subsequent deletions. It identifies a failure mode called sequential reappearance, where an instance that was initially forgotten later returns to the memorized regime without re‑use of the deleted data or adversarial fine‑tuning. The study also finds that reappearing targets exhibit a sharper local denoising‑loss geometry after deletion than those that remain forgotten.

arXiv AI
Sep 1

On the Plasticity Collapse in Continual Machine Unlearning

The paper investigates continual machine unlearning, where models must forget data over time. It identifies a fundamental issue called plasticity collapse, where successive unlearning requests cause geometric constraints that saturate parameter space, leading to two failure modes: forward failure (reduced forgetting quality) and backward failure (re‑memorization). Experiments across architectures and datasets confirm that plasticity collapse is a pervasive problem in continual unlearning.

By Yingdan Shi, Xiang Xu, Kaize Ding, Alfred O. Hero, Ren Wang
arXiv Computer Vision
4d ago

Weeding Out Bad Seeds: Initial-Noise-Robust Unlearning for Text-to-Image Diffusion Models

arXiv:2609.37537v1 Announce Type: new Abstract: Machine unlearning has emerged as a critical post-hoc safety measure to erase sensitive concepts from Text-to-Image (T2I) models without prohibitive re...

By Arian Komaei Koma, Seyed Amir Kasaei, Aida Aryafar, Matin Ghiasi, Ali Aghayari, Amirhossein Souri, Mohammad Mosayyebi, AmirMahdi Sadeghzadeh, Mohammad Hossein Rohban
arXiv AI
Jun 3

PURGE: Projected Unlearning via Retain-Guided Erasure

arXiv:2606. 03808v1 Announce Type: cross Abstract: We propose PURGE, a machine unlearning algorithm built on a simple but an under-exploited observation: continual learning (CL) and machine unlearning (MU) which are fundamentally dual problems.

By Vedant Jawandhia, Daksh Ahuja, Ghufran Alam Siddiqui, Prashant Trivedi, Yash Sinha, Pratik Narang
arXiv AI
Sep 10

CUNO: Curriculum and Preference Optimization for Stable Graph Unlearning under Mass Deletion

CUNO is a curriculum‑based graph unlearning framework that progressively removes a designated set of training samples, ordering them by estimated unlearning difficulty across multiple stages. It also introduces a distribution‑level negative preference optimization objective at each stage to steer the model away from its original behavior on the current forget subset while preserving performance on retained data. Experiments show that CUNO mitigates catastrophic unlearning, retaining 74% of original utility at 20% deletion and more than half at 50% deletion, outperforming existing methods.

By Chenhan Zhang, Ali Braytee, Madhushi Bandara, Xin Hao, Paul J. Kennedy, Massimo Piccardi, Raymond Owen
arXiv Machine Learning
Jun 10

The Emergence of Reproducibility and Generalizability in Diffusion Models

arXiv:2310. 05264v5 Announce Type: replace Abstract: In this work, we investigate an intriguing and prevalent phenomenon of diffusion models which we term as "consistent model reproducibility": given the same starting noise input and a deterministic sampler, different diffusion models often yield remarkably similar outputs.

By Huijie Zhang, Jinfan Zhou, Yifu Lu, Minzhe Guo, Peng Wang, Liyue Shen, Qing Qu