REDaCT: Collapse-Free Unlearning in Large Reasoning Models
Unlearning in large reasoning models (LRMs) requires removing forget-set information from both the reasoning trace and the final answer.
ProofPaper ↗
Key points
- Existing approaches achieve this objective at the cost of reasoning collapse, where the model fails to produce a coherent chain-of-thought (CoT) and does not properly terminate its reasoning process.
- Experimental results show that REDaCT completely avoids reasoning collapse, substantially improving reasoning preservation compared to state-of-the-art unlearning methods while maintaining perfect answer forgetting and near-perfect CoT forgetting.
Sources (1)
- [1]REDaCT: Collapse-Free Unlearning in Large Reasoning ModelsarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 8, 10:22 PM
Unlearning in large reasoning models (LRMs) requires removing forget-set information from both the reasoning trace and the final answer.
Existing approaches achieve this objective at the cost of reasoning collapse, where the model fails to produce a coherent chain-of-thought (CoT) and does not properly terminate its reasoning process.
Extractive summary: sentences quoted from the sources.
Before this
- Oct 8, 2026openai/codex rust-v0.162.0: 0.162.0
- Oct 8, 2026Show HN: Jevman – AI decision models play Pac-Man
- Oct 8, 2026Microsoft Joins the Local AI Push
- Oct 8, 2026Understanding Jev, the new model everyone is talking about
- Oct 8, 2026SpatialOPSD: Self-Distilling Spatial Intelligence from Verified Coding Agent Traces
- Oct 7, 2026[AINews] Claude Haiku 5.5 — better than GPT-6 Luna at the same pricing