- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper introduces a controlled evaluation suite for studying LLM unlearning across different stages of the training lifecycle. The authors pretrain OLMo-2 models from 179M to 2.7B parameters with seven types of inserted data and construct matched counterfactual models trained without these insertions. Using these models, the paper evaluates eight unlearning methods after pretraining, learning-rate decay, and mid-training, and studies how removal difficulty varies with model scale, data repetition, and insertion timing. The results show that existing methods often provide limited forgetting or damage model utility, while continued pretraining on fresh data is a strong and stable baseline.
Critical strengths
-
This paper provides carefully matched counterfactual models trained without the inserted data, enabling a much cleaner evaluation of unlearning than benchmarks that rely only on behavioral proxies or fine-tuned forget sets.
-
The evaluation suite is unusually comprehensive, covering four model scales, seven types of removal targets, multiple training stages, and eight representative unlearning methods under a shared training pipeline.
-
The finding that continued pretraining on fresh data is difficult to outperform is both surprising and practically useful, and the analysis of insertion timing, repetition, model scale, and learning-rate decay provides valuable guidance for future unlearning research.
Critical weaknesses
i) The interpretation of the counterfactual models as “exact ground truth” would benefit from further qualification.
Training carefully matched experiment and counterfactual models at four scales is a substantial and valuable contribution. Controlling the initialization and training batches provides a much cleaner reference than is available in most existing LLM unlearning benchmarks. However, each counterfactual is based on a single training seed and therefore represents one particular retraining outcome rather than the broader distribution of models that could result from removing the target data [a, b, c]. This does not invalidate the paired comparisons, but the paper should clarify the scope of “exact ground truth” and, if feasible, estimate ordinary training variation using multiple runs at one of the smaller model scales.
The paper also states that the counterfactual models exclude the controlled insertions, but it does not report whether the original OLMo-mix corpus was screened for exact or approximate overlap with the seven target datasets. This is particularly relevant for public news articles, benchmark questions and answers, SODA conversations, and related factual or reasoning content. Data contamination can materially affect model behavior even under limited exposure [d]. If the base corpus already contains these targets or close variants, the counterfactual model represents a model without the additional controlled exposures rather than one that never observed the target information. Reporting exact-match, near-duplicate, and semantic-overlap checks would clarify which results measure complete target removal and which measure removal of the incremental effect of insertion.
ii) The current design evaluates joint removal rather than providing task-specific ground truth for each target.
All seven target datasets are inserted into the same experiment model, and the matched counterfactual is trained without any of them. This design is computationally efficient and enables a broad set of evaluations from a single training run, but the resulting reference corresponds to jointly removing the full collection. It does not directly represent a request to remove one target while retaining the other six. For example, a counterfactual for deleting only the MUSE news articles should still contain the fictional entities, math problems, canary conversations, benchmark answers, and backdoor examples. Standard unlearning formulations define the reference relative to the particular subset requested for deletion [a, b, c].
The joint design also makes it difficult to rule out interactions among the heterogeneous targets during pretraining and unlearning. A method receives a combined forget set containing text memorization, factual knowledge, reasoning capabilities, privacy canaries, and adversarial signals, so its performance on one metric may be influenced by updates associated with the other targets. The suite therefore provides seven evaluation signals within a joint removal experiment rather than seven fully independent unlearning tasks. Task-specific counterfactuals for a representative subset, or smaller controlled experiments comparing joint and individual removal, would help establish whether the main conclusions transfer to realistic single-target deletion requests.
[a] Certified Data Removal from Machine Learning Models. ICML 2020.
[b] Machine Unlearning. IEEE Symposium on Security and Privacy 2021.
[c] Remember What You Want to Forget: Algorithms for Machine Unlearning. NeurIPS 2021.
[d] How Much Can We Forget about Data Contamination? ICML 2025.
Questions for authors
-
Was the original OLMo-mix corpus checked for exact or approximate overlap with the seven target datasets, particularly the public news articles and benchmark data?
-
Do the conclusions remain similar when one target dataset is inserted and removed independently rather than jointly with the other six targets?
4 comments
Response to Reviewer Xhtm (part 2)
Do the conclusions remain similar when one target dataset is inserted and removed independently rather than jointly with the other six targets?
Because training seven separate counterfactual Retraining models from scratch is computationally prohibitive, our main setup evaluates joint removal across the inserted tasks, comprising only 0.5% of the 210B pre-training tokens, a regime where prior work has shown that distinct pre-training insertions exhibit negligible interference (Bordt & Pawelczyk, 2026). Following your suggestion for a controlled experiment, we ran an additional experiment comparing single-task unlearning against the baseline of no unlearning. Specifically, we took the optimal configurations for two representative methods (RMU and SimNPO), performed unlearning on only one target task at a time, and evaluated each resulting model across all tasks relative to the un-unlearned Baseline (Appendix D.8, Figure 20).
Our conclusions remain overall unaffected. We see that SimNPO again struggles with removing benchmark contaminations, Gaussian poisons as well as Backdoor attacks. We see similar patterns for RMU. Strikingly, most of the metric reduction caused by these methods is non-specific: for example, when RMU targets any of the other five tasks, the TPR on MUSE News still drops by 20–22%, compared to 24% when RMU explicitly targets MUSE News itself. Hence, the dedicated unlearning are not surgical, instead unlearning one task affects the others too. The complete results for the RMU and SimNPO methods can be found in Appendix D.8 Figure 20.
We thank the reviewer again for their thoughtful comments and feedback. We hope we addressed all your questions/concerns/comments adequately. In light of our clarifications, please consider increasing your score.
Thank you for the detailed responses and additional experiments. The clarification of the coupled counterfactuals, overlap audit, and single-task unlearning results address most of my concerns. I appreciate the work that went into these additions and remain positive about the paper. I will maintain my positive score.
Response to Official Comment by Reviewer Xhtm
Much appreciated!
Best wishes, the authors
Response to Reviewer Xhtm (part 1)
We thank the reviewer for their positive assessment of our work, and for highlighting the value of our matched counterfactual models across four scales, seven task types, and multiple lifecycle stages. We have run the exact overlap audits and single-target unlearning ablations you suggested, which are now included in Appendix D.7 and Appendix D.8 of the revised manuscript. Below, we address your two main questions and points in detail.
We completely agree with the theoretical distinction you raise regarding retraining distributions [a, b, c]. As noted in Appendix A (Limitations) and Appendix B, each counterfactual shares the exact random initialization and batch order of its corresponding experiment model. In our setting, this coupled design is a deliberate variance-reduction choice: by fixing all sources of stochasticity (initialization and mini-batch ordering), the difference between the experiment model and the counterfactual isolates the exact causal effect of the inserted sequences without confounding run-to-run training noise. We will update the text to clarify that our counterfactuals represent the exact coupled counterfactual (for a fixed seed and batch order) rather than a distribution over independent retraining seeds.
To verify whether any of our target insertions already existed naturally in the base pretraining dataset, we audited 1,000 samples per task for exact word-for-word matches using infini-gram [Liu et al., 2024, https://huggingface.co/spaces/liujch1998/infini-gram] against both the full OLMo-mix-1124 corpus and the specific 5.38% subset used in our pretraining runs (full details are in Appendix D.8.):
This audit suggests that background contamination does not affect our conclusions for three reasons: