The paper introduces REDaCT, an inference-time unlearning framework for large reasoning models that removes forget-set information from both the reasoning trace and the final answer without causing reasoning collapse. REDaCT uses a binary leak detector to spot sentences that leak forget-set data and an embedding optimization module that injects a corrective embedding at the first detected leak, steering subsequent reasoning toward non-leaking sentences. Experiments demonstrate that REDaCT preserves coherent chain-of-thought reasoning, outperforms existing unlearning methods, and achieves perfect answer forgetting with near-perfect chain-of-thought forgetting.
By Joshua Maccoby, Wendy Hui Wang
arXiv:2610.14605v1 Announce Type: new
Abstract: Current evaluations of multimodal unlearning typically focus on whether a model stops outputting target information. This surface-level criterion, howe...
By Haodong Chen, Shengtao Wen, Dong Liang, Lingbing Guo, Xiang Chen
arXiv:2606. 05201v1 Announce Type: new Abstract: Reasoning language models do not distinguish tokens used for computation from tokens that constitute persistent state: once generated, all hidden thoughts remain in context and influence future predictions.
By Fei Ding, Yongkang Zhang, Runhao Liu, Yuhao Liao, Zijian Zeng, Huiming Yang
The paper identifies a specific issue in supervised fine‑tuning (SFT) of large language models called factual access failure, where models can recognize correct facts under constrained tests but fail to generate them in open‑ended settings. It demonstrates that SFT can cause both genuine wrong answers and expression‑level errors such as verbosity or formatting mismatches. To mitigate this, the authors propose Recall‑Anchored Distillation (RAD), a self‑distillation method that aligns the fine‑tuned model with the base model’s soft output distribution on unlabeled out‑of‑distribution text, thereby recovering lost factual recall without needing labeled data.
By Haodong Chen, Yadong Wang, Shengtao Wen, Dong Liang, Xiang Chen
arXiv:2607. 09236v1 Announce Type: new Abstract: Machine unlearning in LLMs is the targeted removal of specific knowledge while preserving all other capabilities, critical for privacy and safety.
By Amit Peleg, Naman Deep Singh, Naama Pearl, Bibhabasu Mohapatra, Matthias Hein
arXiv:2510. 21978v2 Announce Type: replace-cross Abstract: Reinforcement learning with verifiable rewards (RLVR) has delivered impressive gains in mathematical and multimodal reasoning and has become a standard post-training paradigm for contemporary language and vision-language models.
By Hoang Phan, Xianjun Yang, Yuanshun Yao, Jingyu Zhang, Shengjie Bi, Xiaocheng Tang, Madian Khabsa, Lijuan Liu, Deren Lei