mlsanityData to 14 Oct 2026

ST2U: Stateful Test-Time Unlearning via Restricted Knowledge Boundary Control

arXiv 2608.23034 ↗First posted 24 Aug 2026cs.LG cs.CLcited by 1

On the map: LLM alignment / RLHF / preference optimisation → LLM preference optimization methods

also in 1 more
Abstract (arXiv)

Controlling restricted knowledge in large language models is essential for model alignment and safe deployment. Test-time unlearning avoids costly retraining and parameter updates by intervening only during inference. However, existing activation-editing methods apply isolated pointwise corrections, overlooking how autoregressive generation continually reconstructs hidden states from the prompt, cache, and generated prefix. Consequently, later states may return to restricted knowledge regions after a locally successful correction, causing restricted knowledge re-entry. In this work, we propose Stateful Test-Time Unlearning via restricted knowledge boundary control (ST2U), which formulates test-time unlearning as trajectory-wide boundary control. ST2U first models restricted knowledge boundaries in low-dimensional invertible coordinates while leaving orthogonal non-target components unchanged. During inference, ST2U monitors risk along the trajectory, applies minimal boundary corrections with contextual anchoring, and propagates historical correction states across tokens to mitigate knowledge re-entry. This trajectory-wide control enables more persistent forgetting while preserving non-target capabilities and limiting inference overhead. Across three benchmarks and three model families, ST2U delivers the strongest overall balance, combining best or second-best retention with competitive forgetting and substantially less restricted-knowledge re-entry than test-time baselines (13.76%-19.84% versus 46.50%-59.10%).

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in LLM preference optimization methods, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 9 of its 41 references that are in the map. First posted on arXiv 24 Aug 2026.

Builds on

9 of 41 references.

References · 9

  1. 2025Qwen3 Technical Reportcited by 8,820
  2. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  3. 2023Who's Harry Potter? Approximate Unlearning in LLMscited by 381
  4. 2025Qwen3Guard Technical Reportcited by 155
  5. 2025A Comprehensive Survey of Machine Unlearning Techniques for Large Language Modelscited by 34
  6. 2025Agents Are All You Need for LLM Unlearningcited by 10
  7. 2025UniErase: Towards Balanced and Precise Unlearning in Language Modelscited by 5
  8. 2026Beyond Linear Activation Steering: Invertible Latent Transformations for Controlling LLM Behaviorcited by 3
  9. 2026FUPareto: Bridging the Forgetting-Utility Gap in Federated Unlearning via Pareto Augmented Optimizationcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026Inference-Time Machine Unlearning via Gated Activation Redirection
  2. 2026CAP: Controllable Alignment Prompting for Unlearning in LLMs
  3. 2026Crossing the Margin Cliff: Toward Relearn-Robust LLM Unlearning via Margin Calibration
  4. 2026Not Every Change Is Necessary: Recoverable Drift in Large Language Model Unlearning
  5. 2026SAUL: Sharpness-Aware Augmented-Lagrangian Unlearning
  6. 2026CURaTE: Continual Unlearning in Real Time with Ensured Preservation of LLM Knowledge
  7. 2025Beyond Superficial Forgetting: Thorough Unlearning through Knowledge Density Estimation and Block Re-insertion
  8. 2025ReLearn: Unlearning via Learning for Large Language Models