- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
This paper tries to look at the problem of quantization and its effect on machine unlearning. It is known that quantization can have the unwanted effect of reversing machine unlearning. They show that compression can cause reversal of machine unlearning and that models that can retain unlearning after quantization barely change the model. In view of this they introduce two mechanistic frameworks, namely Mechanistic-Aligned Null-Space Unlearning (MANSU), which they suggest addresses the above issue, and Circuit Attribution Divergence (CAD), a metric that provides evidence of circuit level structural change beyond behaviour suppression.
Critical strengths
The paper tries to study an important problem in the literature, that of the effects of compression on machine unlearning algorithms. Since models are generally transferred and stored through compressive means the unwanted effect of a compression algorithm destroying forgetting capability is an important research problem.
Critical weaknesses
- The paper is extremely poorly written and at times reads like a bunch of bullet points with no real narrative of what the authors are trying to tell the reader. Even the description of the problem they are trying to address is not well stated and I had to read the paper several times and do a literature search myself to understand the context better.
- The technical theorems, propositions and lemmas are often stated with poor context making it difficult for the reader to gain insight into what the authors are trying to do. I had to read the technical analysis, section 5 as well as Section D, several times and even then I found myself getting lost with regards to what exact insight the authors are trying to get across.
- There are parts of the papers that make no sense. For example, their discussion section 7 makes absolutely no sense to me. It is unclear what the authors are trying to tell the reader. This sort of writing occurs in several parts of the paper, e.g. first paragraph of section 5. I commend the authors for being upfront with their use of AI in their AI statement but it is crystal clear the authors have made no effort in trying to exposit in a better way the AI led research they have carried out. If one is going to use AI to help in the actual research then it is the duty of one to make sure they exposit that outcome of that research in a way that is understandable for human readers. The authors have not done this making it impossible to understand what they are trying to get across to the reader.
Questions for authors
- I found it almost impossible at times to parse the theorems, propositions and lemmas in your paper. Can you give a clear explanation of what proposition 1is supposed to be telling us?
- In Theorem 1 I am confused as to what is ? Also, in that theorem you assume the loss has Hessian that is PSD. This is almost never true though right? It would imply convexity of the loss function I would think, which makes the analysis extremely simple.
- Figure 2 must have been made with an LLM as it makes absolutely no sense to me. Can you please explain what on earth this figure is trying to show the reader?
- I also have no idea what you are trying to say in the limitations section in section 7. Can you elaborate on this? It would be much easier if you said exactly what the limitations of MANSU and CAD are separately.
2 comments
Dear Reviewer WwQr ,
We are writing to ask whether our rebuttal has addressed your concerns. We would be happy to discuss any remaining issues.
Response to reviewer WwQr
In one paragraph, models are usually quantized to 4 bits before deployment. Prior work has shown that this can bring back knowledge that unlearning had removed. We show why. Unlearning methods change each weight by much less than the gap between two 4-bit values, so rounding snaps most weights back to where they were. MANSU (i) finds the small set of weights causally responsible for the target knowledge, (ii) restricts the update to those weights while protecting retain performance, and (iii) makes each changed weight move at least one 4-bit step, so the change survives rounding. The answers below address each question directly. The same fixes are reflected in a revised version of the manuscript.
Proposition 1: the tradeoff it formalizes.
Spreading a fixed retain-safety budget over more parameters forces each one's update to shrink, since the same budget is divided more ways. Concentrating it into fewer parameters lets each move further before the retain constraint is violated. Formally, every coordinate satisfies a worst-case bound driven by the smallest per-parameter Fisher value in the circuit, unconditionally, and a sharper estimate using the mean Fisher value holds under the equal-magnitude allocation gradient ascent produces in practice. For Llama-3.1-8B, updating the full parameter set this way moves each weight about 380 times below the deployment rounding floor, which is why no existing method survives quantization without first shrinking which parameters it touches.
Theorem 1: the missing notation and the PSD-Hessian assumption.
The notation the bound depends on is H (the retain-loss Hessian), C-bar (the parameters outside the circuit), and ker(H restricted to the circuit), meaning directions inside the circuit that don't change the retain loss to second order. If a different symbol was meant, happy to clarify further once we've confirmed which one against the review itself. On soundness, we have actually tightened the theorem rather than defend the PSD condition. Under the theorem's own stated conditions, the update is zero outside the circuit and lies in the circuit's Hessian null space inside it, so the second-order term in the Taylor expansion vanishes exactly, as our own appendix proof already showed. No assumption on the sign or convexity of the retain-loss Hessian is needed anywhere, and the revised bound is correspondingly tighter.
Limitations of MANSU.
Limitations of CAD.
Figure 2: what each panel shows, and the two label fixes.
Panel 1 (Localize): EAP-IG ranks MLP layers by causal contribution to the forget answers and keeps the top layers as the circuit. Panel 2 (Project): updates restricted to that circuit are masked along a retain-protective Fisher threshold. Panel 3 (Floor): a per-parameter magnitude floor rescales each update so it survives 4-bit rounding. Two label corrections, independent of the panel content, are now reflected in the revised Figure 2. Panel 2's threshold now reads tau = 0.1 times the mean Fisher value (it previously read "99th percentile," which was stale), and Panel 3's guarantee is now scoped to the narrow-bin majority of circuit weights (about 65%), with the remainder empirically confirmed rather than unconditional.