Forgetting That Sticks: Quantization-Permanent Unlearning via Circuit Attribution

Hugging Face Daily Papers Papers

Summary

This paper identifies a fundamental sparsity-permanence tradeoff where quantization reverses machine unlearning, and proposes MANSU, a method combining causal circuit attribution and null-space projection to achieve quantization-permanent forgetting.

Standard unlearning evaluations measure behavioral suppression in full precision, immediately after training, despite every deployed language model being quantized first. Recent work has shown that 4-bit post-training quantization can reverse machine unlearning; we show this is not a tuning artefact but a systematic dual failure: gradient-based methods that achieve meaningful forgetting lose it under compression, while methods that survive quantization barely change the model. Both failures trace to the same root cause: across all baselines, per-parameter updates lie 47-828x below the NF4 quantization bin width; updates diffused across billions of parameters cannot clear quantization bin boundaries, a consequence we formalize as a sparsity-permanence tradeoff. We present MANSU (Mechanistic-Aligned Null-Space Unlearning), which resolves both modes by combining causal circuit attribution to isolate the minimal forget-set subgraph, circuit-restricted null-space projection with a diagonal-Fisher retain bound, and a per-parameter magnitude floor guaranteeing quantization survival by construction. We additionally introduce Circuit Attribution Divergence (CAD), a mechanistic verification metric distinguishing structural erasure from behavioral suppression, a distinction existing metrics cannot make. Across multiple model families and hazard benchmarks, MANSU is the first method to jointly satisfy all four properties with margin on each (meaningful forgetting, retain preservation, non-positive PTQ gap, and structural erasure), while gradient-based baselines recover up to +0.05 accuracy under compression.
Original Article
View Cached Full Text

Cached at: 05/18/26, 06:27 PM

Paper page - Forgetting That Sticks: Quantization-Permanent Unlearning via Circuit Attribution

Source: https://huggingface.co/papers/2605.15138

Abstract

Quantization reverses machine unlearning effects, revealing a fundamental sparsity-permanence tradeoff where parameter updates fall below quantization bin widths, leading to the development of MANSU to achieve both forgetting and retention preservation under compression.

Standardunlearningevaluations measurebehavioral suppressionin full precision, immediately after training, despite every deployed language model being quantized first. Recent work has shown that 4-bit post-trainingquantizationcan reverse machineunlearning; we show this is not a tuning artefact but a systematic dual failure: gradient-based methods that achieve meaningful forgetting lose it under compression, while methods that survivequantizationbarely change the model. Both failures trace to the same root cause: across all baselines, per-parameter updates lie 47-828x below the NF4quantizationbin width; updates diffused across billions of parameters cannot clearquantizationbin boundaries, a consequence we formalize as asparsity-permanence tradeoff. We present MANSU (Mechanistic-Aligned Null-SpaceUnlearning), which resolves both modes by combiningcausal circuit attributionto isolate the minimal forget-set subgraph, circuit-restrictednull-space projectionwith adiagonal-Fisher retain bound, and aper-parameter magnitude floorguaranteeingquantizationsurvival by construction. We additionally introduceCircuit Attribution Divergence(CAD), a mechanistic verification metric distinguishingstructural erasurefrombehavioral suppression, a distinction existing metrics cannot make. Across multiple model families and hazard benchmarks, MANSU is the first method to jointly satisfy all four properties with margin on each (meaningful forgetting, retain preservation, non-positivePTQ gap, andstructural erasure), while gradient-based baselines recover up to +0.05 accuracy under compression.

View arXiv pageView PDFAdd to collection

Get this paper in your agent:

hf papers read 2605\.15138

Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash

Models citing this paper0

No model linking this paper

Cite arxiv.org/abs/2605.15138 in a model README.md to link it from this page.

Datasets citing this paper0

No dataset linking this paper

Cite arxiv.org/abs/2605.15138 in a dataset README.md to link it from this page.

Spaces citing this paper0

No Space linking this paper

Cite arxiv.org/abs/2605.15138 in a Space README.md to link it from this page.

Collections including this paper1

Similar Articles

Fast Unlearning at Scale via Margin Self-Correction

arXiv cs.LG

Introduces MASC (Margin Self-Correction), an efficient unlearning method for LLMs that uses an online stopping rule to achieve competitive forget–retain trade-offs at reduced computational cost, validated on TOFU and MUSE benchmarks.