Sign inGet started
Paper · arXiv

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. 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. To address this challenge, we propose REDaCT (REgenerate via Detection and Corrective Tuning), an inference-time unlearning framework for LRMs. REDaCT consists of two key components: (1) a binary leak detector that identifies sentences in the reasoning trace that leak forget-set information, and (2) an embedding optimization module that learns a corrective e...

AuthorsJoshua Maccoby, Wendy Hui Wang
Primary categorycs.LG
Published8 October 2026
Last updated at source8 October 2026
cs.LGcs.AIcs.CL
Embed this entry
<iframe src="https://silytics.si/embed/item/712c0d35-20c1-4fb8-8a86-d35df3857ac7" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Popularity, last 2 days

0 now. Counts as reported by the source, snapshotted daily by Silytics.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.