Fantastic Targets for Concept Erasure in Diffusion Models and Where To Find Them

Anh-Vu Bui, T. Vũ, Tung-Long Vuong, Trung Le, Paul Montague +3 more
2/12/2026

No official code found. Best implementation: tuananhbui89/Adaptive-Guided-Erasure (13 stars, last commit 2025-08-14).

Abstract

Concept erasure has emerged as a promising technique for mitigating the risk of harmful content generation in diffusion models by selectively unlearning undesirable concepts. The common principle of previous works to remove a specific concept is to map it to a fixed generic concept, such as a neutral concept or just an empty text prompt. In this paper, we demonstrate that this fixed-target strategy is suboptimal, as it fails to account for the impact of erasing one concept on the others. To address this limitation, we model the concept space as a graph and empirically analyze the effects of erasing one concept on the remaining concepts. Our analysis uncovers intriguing geometric properties of the concept space, where the influence of erasing a concept is confined to a local region. Building on this insight, we propose the Adaptive Guided Erasure (AGE) method, which \emph{dynamically} selects optimal target concepts tailored to each undesirable concept, minimizing unintended side effects. Experimental results show that AGE significantly outperforms state-of-the-art erasure methods on preserving unrelated concepts while maintaining effective erasure performance. Our code is published at {https://github.com/tuananhbui89/Adaptive-Guided-Erasure}.

View on arXivView PDF

Code Implementations(1)

ICLR 2025 - Fantastic Targets for Concept Erasure in Diffusion Models and Where To Find Them

133Shell, PythonSep 30, 20241 years ago

Similar Papers

Cite this paper

@article{bui2026fantastic,
  title  = {Fantastic Targets for Concept Erasure in Diffusion Models and Where To Find Them},
  author = {Anh-Vu Bui and T. Vũ and Tung-Long Vuong and Trung Le and Paul Montague and Tamas Abraham and Junae Kim and Dinh Q. Phung},
  year   = {2026},
  eprint = {2501.18950},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2501.18950},
  journal = {ICLR 2025 2025}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2501.18950.svg)](https://codeofpaper.com/paper/2501.18950)

Discussion