- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 1
Read review
Paper summary
This paper aims for generalizable unlearning to mitigate training image memorization in diffusion models. Generalizable unlearning requires unlearning a "forget set" results in unlearning a disjoint "held out" set from the same distribution. Concretely, the paper finds that memorized images and non-memorized ones are linearly separable according to their middle embeddings from the model. Then a fine-tuning-based unlearning method is designed to steer embeddings of memorized images towards non-memorized nearest neighbours. Experiment results demonstrate its effectiveness compared to several unlearning baselines.
Critical strengths
The motivation of studying generalizable unlearning for memorization is of large significance and technical challenges. This paper provides an empirically effective method to tackle this problem. The overall idea is meaningful and experimentally verified, which I would judge as the major strength that supports acceptance.
Critical weaknesses
- Soundness of the linear classifier. A lot of recent works on security research proposes to use linear separability of latent representations to interprete and mitigate various vulnerabilities in LLMs, diffusion models, etc. However, we should be careful when claiming and leveraging this property in high-dimensional space, especially with limited samples. Acoording to Cover's theorem or VC dimension, it is easy to build a linear classifier in high-dimensional space for a small number of points in general position. The paper does not detail the dimensionality or sample size used in studying this property, which would raise severe concerns on the soundness of the conclusion.
- Limited evaluation. As reported in experimental setups, hundreds of samples are used for evaluation. This scale of evaluation may not strongly demonstrate the effectiveness of the proposed method.
Questions for authors
- The authors should provide more solid evidence for the linear separability of memorization.
- The effectiveness of the proposed unlearning technique should be more comprehensively assessed. Hundreds of images is a trivial scale for a generalizable approach to stand on.
4 comments
References:
[1] A reproducible extraction of training images from diffusion models. Webster. 2023.
[2] Understanding and mitigating copying in diffusion models. Somepalli et al. NeurIPS 2023.
[3] Detecting, explaining, and mitigating memorization in diffusion models. Wen et al. ICLR 2024.
[4] Unveiling and Mitigating Memorization in Text-to-image Diffusion Models through Cross Attention. Ren et al. ECCV 2024.
[5] You Don't Need All That Attention: Surgical Memorization Mitigation in Text-to-Image Diffusion Models. Zhao et al. ICML 2026.
In summary, we have tried our best to address the reviewer's concerns through additional experiments and clarifications, as outlined below. We hope these efforts will help the reviewer reconsider their assessment of our work, and we would be happy to address any remaining questions.
| Concern | Response |
|---|---|
| Cover’s theorem, soundness of linear separability (W1, Q1) | Clarified that our reported accuracies are cross-validated on held-out examples, and provided controlled artificial memorization experiments and random-label controls to show that high dimensionality alone cannot explain the observed separability. |
| Evaluation scale (W2, Q2) | Expanded our experiments to Webster-500 and MemBench-3k, where BLUR continues to outperform competing methods in memorization reduction. |
Dear Reviewer Rezr,
Thank you again for your thoughtful feedback. We believe that we have addressed all of your concerns and we are eager to hear back from you given that the discussion phase is coming to a close soon.
As detailed in our earlier response, we have comprehensively addressed your feedback, including via additional controls to further validate our representational separability findings in high-dimensional space, as well as expanded our evaluation to MemBench-3k. These further strengthen our claims and we will add them to the paper.
Beyond these, the rebuttal also added several results that strengthen the paper:
- Additional controls separating memorization from distribution effects (responses to Reviewer 7BYF and xfbr, Table A, E) showing that memorization contributes to representational separability beyond distributional differences.
- A non-memorized control for BLUR’s generalization to held-out memorized examples (response to Reviewer 7BYF, Table C) showing that BLUR generalizes strongly to held-out memorized examples, and this cannot be explained by semantic similarity alone.
- An evaluation on SD v3, extending our findings to a further architecture (response to Reviewer xfbr, Table D-1, D-2) which gives us further evidence for the generalizability of our findings.
Please let us know if you have any other concerns, we'd love to discuss them if so.
Authors
I thank the authors for their defailed response. I have read the comments from the other reviewers and would not raise any more concerns. I would consider to change my rating based on next-stage discussion with AC and other reviewers.
We sincerely thank Reviewer Rezr for the careful and thoughtful review. We respond to each point below.
W1, Q1: Soundness of the linear classifier. We thank the reviewer for raising this concern. We agree that high-dimensional representations (1280 dimensions for SD v1.4/v2.0 and 1536 for SD3) can make it easier to linearly separate finite training samples, as suggested by Cover's theorem. However, this does not necessarily imply generalization to held-out unseen examples. Importantly, our reported results in Table 1 are cross-validated accuracies on held-out examples, rather than training accuracies.
Furthermore, our controlled experiment in Table A (and in Section 4.2) provides additional evidence. Before memorization induction, the classifier achieves only 51.48% accuracy, despite operating in the same high-dimensional representation space. After inducing memorization, accuracy increases substantially to 89.45%. This suggests that the observed separability cannot be explained by high dimensionality alone.
Table A: Accuracy of a linear classifier to separate examples in a given set I from non-memorized examples in R. We apply an intervention to induce memorization on I, and then apply BLUR on I.
For additional verification, we conduct a random-label control experiment, following the same protocol as in Section 4.1, but with shuffled memorization labels. As shown in Table D, the classifiers achieve near-perfect held-out accuracy with real labels (99.6-100%), whereas accuracy drops to approximately 50% with shuffled labels. Notably, for both settings, the classifier was trained to fit the data reasonably well (training acc close to 100%), yet their held-out accuracies differ dramatically. This further demonstrates that high dimensionality alone does not explain our findings.
Table D: Comparison of separability accuracy between memorized and non-memorized examples, using the memorized dataset with real labels vs shuffled labels.
W2, Q2: Evaluation scale. We thank the reviewer for raising this point. Our original experiments follow the established evaluation protocol in prior studies using the Webster dataset [1-5]. We would like to note that: 1) Memorization, by definition, affects only a small fraction of the training data, which inherently limits the scale of memorization-specific evaluations; 2) Identifying memorized examples in pretrained diffusion models is itself a challenging and active research problem, which presents a practical limitation for memorization-specific evaluations.
Nevertheless, to further address the reviewer's concern, we substantially expand our evaluation to the MemBench (including 3000 memorized prompts identified from LAION), which already goes beyond the commonly adopted Webster benchmark. As shown in Table B-2, BLUR continues to outperform the competing methods, providing further evidence of its effectiveness and generalizability on a broader set of memorization examples.
Table B-2: Broad unlearning results for the MemBench-3k dataset (as M). Best and second-best results among mitigation methods are shown in bold and underlined, respectively.