- Rating
- 3(+1)
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
To address the challenge in machine unlearning of simultaneously erasing a target concept and preserving remaining knowledge, BARRIER proposes shifting the protection mechanism from parameter space to activation space. It performs principal component analysis on activations associated with the unlearning set at selected layers to identify the directions of representational change; within this space, it uses quantiles to define an "unlearning region" where aggressive updates are permitted, while establishing "protected regions" on either side. Using interval arithmetic, it derives a closed-form upper bound for the worst-case change in layer responses within these regions, formulating this as a differentiable regularization penalty added to the standard erasure loss, while updating only a small subset of layers. The paper demonstrates that this penalty precisely controls response changes within protected regions—maintaining validity outside these regions (albeit with bounds that loosen with distance)—and reveals the trade-off between the scope of protection and the allowable intensity of erasure. Experiments show that BARRIER significantly outperforms baselines in class erasure for diffusion models and preserves accuracy in image classification with minimal parameter updates; it exhibits robust resistance to recovery attacks without adversarial training, yet it lags behind or fails in text-to-image generation quality, class erasure for image classification, and random sample unlearning. Furthermore, its theoretical guarantees apply only to the regularization term and single-layer responses rather than the model as a whole, and ablation studies fail to clearly demonstrate that the interval-based protection term is the primary driver of retention capability.
Critical strengths
-
The protection term is closed-form and differentiable; it introduces no additional trainable parameters and requires no changes to the network architecture, allowing for seamless integration with any erasure loss.
-
The paper demonstrates that the protection margin simultaneously determines two factors: the tightness of the boundary surrounding the region, and the erasure intensity. These two factors operate in opposite directions, with the weighting parameter serving only to select the operating point without altering the fundamental structure of the trade-off. This constitutes the paper's most informative theoretical contribution.
-
In diffusion model class erasure, retention accuracy reaches approximately 99%, whereas all baselines reporting this metric collapse to around 14%, while generation quality remains comparable to the retraining-based reference.
Critical weaknesses
-
In Appendix F.1, Table 11, the variant that keeps only the projection and disables the interval terms reaches UA 99.0 and RA 99.4. Both are higher than the full method at 95.20 and 98.62. Only FID is worse. That undercuts the claim that the interval protection term is the source of retention.
-
The interval bound constrains the penalty and the response of one layer. It does not constrain the trained model. It does not constrain end to end behaviour. Across layers the paper offers only a Lipschitz argument with no constants. The phrase formal guarantees on the protection of neutral concepts in the abstract and introduction reads stronger than what is actually delivered.
-
Under random data forgetting UA is about 0.5 to 2.8 percent, which means the forget samples are still classified correctly. Almost nothing gets erased. On class erasure with Stable Diffusion on Imagenette the average is UA 79.60 and FID 9.14, well behind SalUn at 99.82 and 1.22.
-
On Stable Diffusion NSFW, FID moves from 14.10 to 16.61 and CLIP from 31.34 to 30.39, while GLoCE and SAeUron reach the same erasure with equal or better utility. In the ablations the weight is reported as the best setting found, and the main tables never state how it was chosen. Optimistic bias is a real risk here.
-
The interval bound is a standard result from interval analysis. The same interval activation consolidation already appeared in continual learning. Constraining the same response drift at a finite set of points already exists in closed form editing work. What is new here is the continuous region and the tradeoff it exposes. That is enough for a conference paper. It is not the first guarantee of its kind.
Questions for authors
-
Was the SVD only row in Table 11 produced under exactly the same protocol and the same search budget for the weight? It beats the full method on both UA and RA, yet the text calls it the worse tradeoff. Please report the 2×2 ablation.
-
In Tables 1, 2, 4 and 9, is the weight fixed or selected on a validation set? Did the baselines and BARRIER receive the same tuning budget?
-
Can you provide at least one piece of end to end empirical evidence, for example the relation between per layer response drift and final retention accuracy, that connects the single layer bound to the protection of neutral concepts?
-
Does UA near zero on random data forgetting mean the method does not apply to that task? Either state the applicability condition in the abstract, or give a construction that makes the task work.
-
Can you report quantitative retention metrics on prompt sets unrelated to the target concept, rather than FID plus qualitative figures alone?
-
Are the numbers in Tables 1, 2 and 3 from a single run? Please give means and variances over multiple seeds.
-
Is the base erasure rate of 3.15 percent in Table 3 the same metric as the NudeNet value of 17 in Table 1 under a different convention?
3 comments
Dear Authors,
Thanks for your detailed response.
Compared to existing approaches, the performance improvement offered by your method is not significant; in fact, it is even inferior to some established techniques. Although your method is applicable to a broader range of tasks, its overall performance requires further enhancement. Furthermore, I must point out a critical issue: many of the images included in your paper—for instance, those in the first column of Figure 1—would very likely be flagged as "sensitive" (NSFW) by an NSFW classifier. I suggest that you continue to improve the method's performance and, at the same time, revise the selection of images presented in the paper.
In light of the above, I will maintain my original score.
Response to the rebuttal comment
Thank you for the follow-up.
Images. We agree that explicit or borderline imagery does not belong in the paper, regardless of any detector’s score. We used NudeNet to filter those which should not be there. However, as pointed by the Reviewer, there is plenty of such detectors. To make no doubts about the images, we have decided to blur the first column of Figure 1.
Performance. We do not claim to outperform every method on every benchmark, and the revised paper states where BARRIER trails (GLoCE and SAeUron on Stable Diffusion utility, SalUn on Imagenette, MACE under RAB). As the Reviewer noted in the review, the contribution is a bound over continuous regions of activation space rather than at a finite set of points, and the trade-off it exposes between the protected margins and the room left for erasure. It becomes a closed-form penalty with no additional parameters that can be added to any erasure objective. Where it helps most:
Recovery attacks: among methods without adversarial training, the lowest attack success rate under CCE (13.7% vs 46.3% for the next best, RECE) and UD (37.9% vs 41.9%). DDPM: at comparable erasure, better FID than unprotected or restricted updates (16.0–18.3 vs 25.3–40.1, App. L.1), with retain accuracy within 0.7 points of the unchanged model. Flux: the lowest NudeNet total among compared methods (171), on par with the best baseline (173), at the base model’s CLIP score.
Other concerns (the Table 11 protocol, end-to-end evidence, the choice of λ, random forgetting, the Table 3 metric) concerned soundness and the precision of our claims; the revision addresses each of them. We would be grateful to know whether any of these remain open.
Response to the review
We thank the reviewer for their review and insightful feedback. Firstly, we refer the reviewer to the general reponse where we address the major weaknesses. We respond to the reamaining concerns below.
W1/Q1: Each Table 11 row is the best of its own sweep, and the full-method row was Table 9’s single run. Both tables now report the seeded mean at λ = 2 (UA 93.5, RA 99.0, FID 16.0). The missing cell, λ = 0, is clearly worse: UA 75.2, RA 84.5, FID 30.2 (G5, App. L.1). On RA, “SVD only” (99.4) and the full method are both within 0.7 points of the unchanged model (99.7, G3), they differ in UA (99.0 vs 93.5) and FID (17.76 vs 16.0).
W2/Q3: The bound is per layer, yet only the protected layers change and the rest of the network is frozen, so the output change is bounded by the per-layer changes times the Lipschitz constants of the frozen layers that follow (we do not compute them). The end-to-end evidence you asked for (App. L.4, 36 checkpoints): across λ, retain drift tracks FID (ρ = +0.78) and RA (ρ = −0.76), and removing the penalty (λ = 0, one seed) raises retain drift 3.7-fold and worsens all metrics. Holding λ fixed, the penalty still tracks retain drift (within-λ ρ = +0.76) and FID (+0.41, p = 0.045), and forget drift tracks UA (+0.80), while retain drift alone predicts FID and RA only weakly between seeds (+0.21 and −0.15, not significant). So drift and quality move together under λ and the penalty measures the change it limits, we do not claim drift alone explains quality. We improved the descriptions in the manuscript to be more precise. For additional details, please see G1 in the general response.
W3/Q4: We agree that BARRIER is especially beneficial for unlearning classes and concepts, which were our main targets. We improved the abstract to state this directly. Random data forgetting is reported for completeness, there its results are similar to SEMU’s, while retraining itself has UA of only 5.24% / 7.91%. The reason is measurable (App. L.2): under class erasure 0% of retain activations fall inside the forget box, under random forgetting 9–11% do, the same rate as forget activations, so no region can be changed without affecting retained data. Forgetting only part of a class does the same for the samples of that class that stay in the retain set. For additional details, please see G2 in the general response. We agree that we trail SalUn on SD Imagenette.
W4/Q2: Agreed on SD utility versus GLoCE and SAeUron, the text now says so. These results use only the erasure objective plus our penalty, with no retain loss or other mechanism. For the additional details regarding λ selection and tuning, please see G4 in the general response.
W5: We agree that interval bounds are standard and that InTAct came first; we do not suggest otherwise. BARRIER differs from InTAct in two ways that both matter (G6): it inverts the roles, leaving the forget box free and protecting the boxes beside it, and it operates in the SVD subspace of the forget activations ("IA only", the closest variant to InTAct, loses RA and FID). As you note, the continuous protected region for unlearning and the trade-off it exposes are new. The penalty is closed-form, computed once from activations, adds no trainable parameters, and can be added to any erasure objective.
Q5: We follow the I2P protocol: FID and CLIP are computed on COCO prompts unrelated to the target.
Q6: Tables 1–3 are single runs, now stated. Table 4 has 3 runs.
Q7: Same checkpoint, different metrics. Table 1 counts NudeNet detections over 4,703 I2P prompts. Table 3’s “Erased” is the share of the 95 STEREO nudity prompts flagged by NudeNet without attack (3/95), following the STEREO protocol exactly. Caption clarified.
We hope that these responses address your concerns. However, if anything still remains open, or if they raised any additional questions, please let us know, and we will be pleased to answer.