- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
- This paper investigates the problem of machine unlearning in terms of noise initialization. The paper argues that the existing unlearning method can mitigate performance in the fixed seed, while still generating harmful content in other seeds. The authors call this phenomenon as “probabilistic forgetting” and propose an adaptive and concept-conditioned strategy for sampling.
Critical strengths
-
The paper investigates an interesting question of machine unlearning regarding the initial seeds and their performance differences.
-
This paper developed an adaptive method to give more importance to the seed that the model does not unlearn.
-
The proposed method can be utilized in previous unlearning strategies.
Critical weaknesses
- Please refer to the Questions below.
Questions for authors
- The term “probabilistic forgetting” should be reconsidered. In machine unlearning, “probabilistic” stands for the probabilistic leakage or guarantee on generated data [1] or a certified guarantee using a similar framework of differential privacy. Please refer to the existing attack papers, such as adversarial attack or membership attack, to find a better notion.
- As stated in Table 12, the proposed method requires additional (about 50%) computations. Can the authors compare the method within the same wall-clock time, not for the same epochs? Also, can the authors compare the additional memory consumption of the proposed method?
- The method relies on importance sampling on the seeds; the method does not erase the concept. However, how can this method generalize to the other seeds (not only for 20) that the model does not observe? I believe that it can improve the performance on seen seeds, but not sure about other seeds not seen in the training.
- The citation should be in parentheses if it does not stand for the authors, e.g., Text-to-Image (T2I) diffusion models have revolutionized content creation (Song et al., 2020; ~~~).
[1] A PROBABILISTIC PERSPECTIVE ON UNLEARNING AND ALIGNMENT FOR LARGE LANGUAGE MODELS, ICLR 25.
4 comments
Follow up
Dear Reviewer KTQc, thank you again for your helpful feedback.
As the discussion period draws to a close, we would appreciate your thoughts on the equal-runtime comparisons and additional memory measurements provided in our rebuttal, as well as our clarification that noise candidates are freshly sampled during training and evaluation uses independently sampled initializations. We have also proposed revised terminology to avoid implying certified unlearning guarantees.
Could you let us know whether any concerns remain, or whether a specific additional experiment or clarification would help resolve them? We would be happy to follow up within the remaining discussion period.
Thank you for the detailed responses regarding computation and memory. These results help clarify the empirical strengths of the paper.
However, I remain concerned about the methodological novelty, particularly the reliance on importance sampling over initial noise seeds, as I mentioned in my earlier comment. My concern is about the method itself, not just the experimental setup. I think applying importance sampling to initial noise seeds represents a relatively incremental methodological contribution, although identifying and characterizing this failure mode is interesting.
Therefore, I will maintain my current score. I share Reviewer W3RM’s concern regarding the methodological contribution beyond conventional hard-example mining and reweighting.
Thank you for recognizing that this failure mode is important and its characterization interesting. Our starting point was the observation that changing only the initial Gaussian noise can cause an apparently erased concept to reappear under the same prompt. A plausible explanation is that, under a limited unlearning budget, random sampling can miss regions of the noise space where the concept persists. This led us to formulate unlearning as risk minimization over a concept-conditioned distribution of initial noise. We derive the corresponding importance-weighted objective and establish a high-probability bound on the error in estimating its normalizing constant from a finite batch of seeds (Section 4 and Appendix D).
A distinction from unweighted hard-example mining becomes important late in training. Every batch has a highest-scoring seed, even when all concept scores are negligible. Unweighted Top-4 mining still gives the four selected seeds equal weight, so the ranking provides no signal to ease forgetting pressure. Continued updates can then lead to over-unlearning and degrade generation quality. In our method, once the mean concept score falls well below the regularization constant, the importance weights shrink and the forgetting update can approach zero while retention remains active (Eq. 10). This limits the risk of over-unlearning without a separate stopping rule.
To measure what weighting adds beyond selection, we compared three strategies in our response to Reviewer W3RM. All used four of 20 candidate seeds per update, with matched optimization-step budgets within each method. Across 4,000 generated images, random selection yielded 965 failures for ACE and 2,244 for EAP. Unweighted Top-4 mining reduced those counts to 360 and 913. Applying our importance weights under the same Top-4 rule reduced them further to 60 for ACE and 638 for EAP. That is 83.3% and 30.1% fewer failures than unweighted mining, respectively, and 93.8% and 71.6% fewer than random selection.
We also observed gains without any hard-example selection. When all eight randomly sampled seeds contributed to every weighted update, including those with low concept scores, failures fell from 491 to 80 for ACE and from 1,142 to 705 for EAP relative to their original baselines (Appendix L, Table 14). Top-4 selection makes backpropagation more computationally efficient, but the formulation also improves erasure when every seed is retained. Across the broader evaluation, we tested six unlearning methods on four diffusion backbones across three tasks. In the 20-seed nudity evaluation, failures decreased for every method–backbone pairing we tested.
We thank Reviewer KTQc for the thoughtful review and constructive suggestions. We appreciate your recognition of the importance of initial-noise sensitivity and the applicability of our method across existing unlearning strategies. Below, we clarify the terminology and evaluation protocol, provide an equal-runtime comparison, and address memory consumption and citation formatting.
Q1: Terminology. Thank you for highlighting this ambiguity and pointing us to Scholten et al. (2025). Their work develops probabilistic evaluations of LLM outputs with high-probability bounds on information leakage. Our term describes an empirical failure mode: a concept suppressed under one noise initialization re-emerges under another. Both studies examine risks missed by limited evaluations, but we claim no statistical guarantee of concept removal or certified unlearning guarantee. To avoid confusion, we will replace “probabilistic forgetting” with “illusory forgetting” throughout the manuscript, emphasizing that apparent erasure can conceal residual concept accessibility.
We will also cite and discuss Scholten et al. (2025) in the revised related-work section, acknowledging the shared concern that limited evaluations can conceal residual knowledge while distinguishing their probabilistic evaluation framework for LLMs from our study of seed-dependent concept re-emergence in diffusion models.
Q2: Comparison under equal runtime and memory consumption.
To account for candidate-scanning overhead, we compared two representative baselines, ACE and EAP, with thier adaptive counterparts under matched wall-clock budgets: 4 h 40 min for ACE and 3 h 22 min for EAP. Failure counts use the same 20-seed evaluation over 4,000 images as the main paper.
Under equal wall-clock budgets, our method reduces failures by 57.2% for ACE and 35.6% for EAP. These results show that the reduction in multi-seed failure counts persists when candidate-scanning overhead is included in the computational budget.
Memory consumption. Appendix K.1, Table 13 already reports our method’s peak GPU memory consumption under the default N = 20, M = 4 configuration on a single NVIDIA A100 GPU. We will supplement these measurements with the corresponding baseline values to explicitly quantify additional memory consumption.
Q3: Generalization to unseen noise initializations.
The N = 20 candidates are freshly and randomly sampled in each training batch, rather than forming a fixed set of 20 training seeds.
For evaluation, we independently sample 20 random initializations per prompt, producing 4,000 images over the 200-prompt benchmark. The main results are additionally averaged over 10 independent unlearning runs, with means and standard deviations reported in Table 1. Thus, the evaluation measures performance under newly sampled initializations rather than performance on a fixed training candidate set.
Fresh random initializations during training and evaluation, combined with 10 independent runs, provide strong empirical evidence that the improvements generalize beyond the sampled training seeds and are not an artifact of a favorable seed selection.
Q4: Citation formatting. We will revise the manuscript to use parenthetical citations when references support a statement, reserving narrative citations for cases where the authors’ names form part of the sentence.