arXiv:2605. 12765v3 Announce Type: replace Abstract: Large Language Models memorize vast amounts of training data, raising concerns regarding privacy, copyright infringement, and safety.
arXiv:2606. 03808v1 Announce Type: cross Abstract: We propose PURGE, a machine unlearning algorithm built on a simple but an under-exploited observation: continual learning (CL) and machine unlearning (MU) which are fundamentally dual problems.
Reference-Guided Machine Unlearning (ReGUn) is a vision unlearning framework that prioritizes distributional indistinguishability over degradation-based heuristics. It uses disjoint held-out data to create a class-conditioned reference distribution for distillation, guiding forget samples toward non-member behavior without explicitly degrading predictions. Experiments across various architectures and datasets show that ReGUn achieves a competitive forgetting–utility trade-off and closely matches retrain-like membership inference behavior.
The paper introduces Forgetting Only What Matters via Unlearning Layers (FOM-UL), a layer‑selective unlearning framework for large language models. FOM-UL uses a forget‑to‑retain significance score to identify transformer layers that strongly influence the forget set while being insensitive to the retain set, allowing targeted updates that preserve most of the model. Experiments on TOFU, KnowUnDo, and MUSE-style benchmarks show that FOM-UL reduces residual memorization and maintains utility better than several baselines, even after 8‑bit and 4‑bit post‑training quantization, and it also limits recovery of forgotten content in adversarial prompt tests.
Large Language Models (LLMs) can memorize and reproduce sensitive, copyrighted, or otherwise undesirable training content, creating privacy, safety, and regulatory concerns. Machine unlearning offers...
The paper investigates the feasibility of forget‑only unlearning, where a deletion algorithm can only access the trained model and the examples to forget, without any retained data or additional training information. It demonstrates that the possibility of successful unlearning depends on the learning method, showing that different datasets can yield identical models yet require distinct post‑deletion outputs. The authors establish lower bounds on the accuracy of unlearning relative to retraining and prove that, for certain learners, the algorithm must memorize a substantial portion of the training data—potentially the entire dataset—to handle arbitrary deletion requests, implying that models designed for forget‑only unlearning may need to retain more information than standard training does.
The paper identifies a problem in large language model (LLM) unlearning called forget‑set misalignment, where the set of data to be forgotten does not match what the model has actually memorized. Two failure modes are described: Under Unlearning, where memorized information is omitted from the forget set, and Out‑of‑Knowledge Unlearning, where the algorithm attempts to forget knowledge the model never learned, harming performance. The authors propose CONfs, a data‑blind framework that constructs model‑aligned forget sets by eliciting the model’s memorized knowledge, and demonstrate that it achieves near‑gold standard forgetting while preserving utility better than other data‑blind methods.
arXiv:2609.27355v1 Announce Type: cross Abstract: Unlearning ensures LLM compliance by removing the influence of private or copyrighted training data. However, since LLM models typically undergo post...
The paper introduces MUNKEY, a memory‑augmented transformer that enables machine unlearning by design. By decoupling instance‑specific memorization from model weights, unlearning is achieved simply by deleting an instance‑identifying key, allowing zero‑shot forgetting without retraining or accessing original data. Experiments on natural image, fine‑grained visual recognition, and medical datasets show that MUNKEY outperforms existing post‑hoc unlearning methods while maintaining predictive performance.
Machine unlearning for large language models (LLMs) often assumes that a pre-defined forget set matches what the model has memorized, but this frequently breaks in realistic privacy settings where the...
Nullify is a training‑free method for unlearning sensitive information from large language models by steering activations during inference. It uses steering vectors to redirect privacy‑related activations away from memorized answers while enforcing a null‑space constraint that preserves activations for retained queries, thereby maintaining model utility. Experiments on TOFU and MUSE demonstrate that Nullify matches or outperforms existing baselines in forget quality while keeping utility nearly intact, all without any weight updates.
arXiv:2511. 04666v4 Announce Type: replace Abstract: A fundamental challenge in developing general learning algorithms is their tendency to forget past knowledge as they adapt to new data.