ST squared U: Stateful Test-Time Unlearning via Restricted Knowledge Boundary Control
Listen
Radio episode about this paper
Transcript
Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.
Tom: We're looking at the paper: "ST squared U".
Jane: Here's the gist of the paper. Controlling restricted knowledge in large language models is essential for model alignment and safe deployment Testtime 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.
Tom: 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.
Jane: ST2U first models restricted knowledge boundaries in low-dimensional invertible coordinates while leaving orthogonal non-target components unchanged.
Tom: 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.
Title and authors: Tom: So the title itself points to this being about stateful control, which means it keeps track of something over time, and using restricted knowledge boundary control to manage that. The authors are Chen, Gong, Xue, Hu, and Tian from the University of Electronic Science and Technology of China.
Jane: It sounds complicated but they are trying to solve the problem where a local fix doesn't last through the whole generation process. They're proposing a new way to think about unlearning during inference.
Lu: The core idea is that instead of treating each token generation as independent, they want to model these restricted knowledge boundaries in a low-dimensional coordinate system while keeping the parts of the state that aren't target information untouched.
Meng: Low-dimensional coordinates sound efficient for computation, but how do you make sure that this low dimension actually captures all the necessary risk? I need to know if this is just a clever trick or something robust.
Lalam: They model these boundaries using paired restricted and sanitized trajectories before deployment to define what target information looks like in that reduced space.
Tom: That sounds like they are building a geometry for the risky parts, which helps them define exactly where the danger zones are located in that low dimension.
The paper's summary: Jane: So, essentially, ST2U formulates test-time unlearning as trajectory-wide boundary control. This means instead of just checking if a single output is safe, you monitor the risk along the entire path the model takes while it’s generating a response.
Lu: They first construct this restricted knowledge geometry using pairs of sequences, one restricted and one sanitized reference that keeps the high-level context but removes the specific details they want to unlearn.
Tom: And then during inference, they monitor risk along this trajectory and apply minimal boundary corrections with some contextual anchoring to keep things stable.
Meng: Minimal corrections sound good for reducing overhead, but if you don't correct enough, the model might just drift back into the restricted knowledge area again later in the sequence.
Lalam: They do that by propagating historical correction states across tokens so that past fixes help mitigate later violations, which is what they call trajectory-wide control.
Jane: So it’s a system where the controller at each step looks at where it is on this geometry and decides whether to correct based on risk, using history to guide the current action.
The paper's improvements: Tom: The authors show results across three different benchmarks, and they report that ST2U achieves forgetting rates between eighty point six percent and eighty seven point nine percent while keeping non-target capabilities around ninety point seven percent on average.
Jane: That’s a solid trade-off because it shows they aren't just erasing everything; they are successfully preserving the useful, non-target knowledge.
Lu: What I find interesting is that this method limits restricted knowledge re-entry to between thirteen point seven six and nineteen point eight four percent, which is much lower than the forty six point five to fifty nine point one percent you see in leading test-time baselines.
Meng: That reduction in re-entry rate is what matters for production; if we can keep the model from suddenly spitting out sensitive details after a fix, that’s a huge win for safety.
Lalam: They also found that this approach performs consistently across different architectures and knowledge formats, including various backbones and long-form continuation tasks.
Tom: And they achieved the lowest average word memorization prediction error of twenty nine point two six and the highest retained MMLU accuracy of sixty point five eight among all unlearning methods they tested.
Conclusion: Jane: So to wrap up, ST2U takes test-time unlearning from a simple input or output suppression view to a more complex trajectory control view. It models those boundaries in low-dimensional invertible coordinates and preserves the orthogonal non-target structure of the model state.
Lu: The framework gives you this unified runtime control mechanism with target-specific geometries that works across different forgetting scenarios, which is a big step for making unlearning more general.
Meng: I'm still worried about how much overhead this boundary monitoring adds to the actual inference time on a real server, but the fact that it keeps the utility high while reducing re-entry is compelling.
Lalam: The paper suggests that this stateful, boundary-aware trajectory control offers a practical way to get strong forgetting and retention trade-offs with lower knowledge re-entry and stable behavior across testing and continuation tasks.
Tom: We're looking at the ST squared U framework now, which models restricted knowledge boundaries in low-dimensional invertible coordinates, preserves orthogonal non-target structure, and dynamically maintains a shared correction state according to the evolving generation context.
Jane: It really feels like they’ve found a way to make the unlearning process more persistent without having to retrain the massive model every time.
Lu: The future work they suggest looks at sparser trigger policies and adaptive intervention schedules, which would be necessary if we want to reduce that online overhead during actual deployment.
Meng: Sparsity is key for us; we can't afford constant, heavy monitoring during high-throughput serving.
Lalam: So ST2U gives us a path toward a more robust and persistent way to handle restricted knowledge in these large language models.
University of Electronic Science and Technology of China 2Southwest Jiaotong University
cs.LG, cs.CL
Submitted: 2026-08-24
Updated: 2026-11-10
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Importance score: 88/100
The gist: Controlling restricted knowledge in large language models is essential for model alignment and safe deployment Testtime unlearning avoids costly retraining and parameter updates by intervening only…
Key concepts
- Restricted Knowledge Re-entry (RF)
- This is a problem where a model initially corrects a harmful output but later produces it again. It happens when the model decoding returns to the restricted topic, causing a renewed violation before any further intervention occurs. ST2U aims to restore every violating state using past corrections to stop this recurrence.
- Restricted Knowledge Geometry (RKG)
- RKG is a low-dimensional risk map created beforehand by comparing restricted and sanitized text sequences. It learns how the model's hidden states relate to target knowledge versus non-target knowledge, allowing ST2U to define safe boundaries in this simplified space.
- Stateful Boundary Control (SBC)
- SBC monitors the model's state during inference against the RKG boundary. If a state is risky, it applies a correction update that combines normal descent with memory of past corrections. This ensures that corrections are applied consistently along the generation path without causing instability.
Terminology
Summary
Controlling restricted knowledge in large language models is essential for model alignment and safe deployment Testtime 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. p. 0 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. p. 0 ST2U first models restricted knowledge boundaries in low-dimensional invertible coordinates while leaving orthogonal non-target components unchanged. p. 0 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. p. 0 This trajectory-wide control enables more persistent forgetting while preserving non-target capabilities and limiting inference overhead. p. 0
Problem Formulation of Knowledge Re-entry
Restricted Knowledge Re-entry occurs when a locally effective intervention initially yields a safe high-level explanation, but later decoding returns to the restricted topic and produces harmful details. We define this recurrence as restricted knowledge re-entry: RF (h′t0) ≤ τ, ∃ t1 > t0: RF (ht1) > τ. p. 1 This recurrence denotes a renewed violation before the controller acts at t1, rather than failure to correct that state. p. 1 Stateful test-time unlearning should restore every violating state while using past corrections to reduce later violations. p. 1
ST2U Framework Components
ST2U comprises two components (shows in Fig. 3). Restricted Knowledge Geometry (RKG) constructs a taskspecific, low-dimensional risk geometry from paired restricted and sanitized trajectories before deployment. p. 2 Stateful Boundary Control (SBC) monitors this geometry during inference and summarizes accepted correction directions in a fixed-dimensional state mt ∈ Rk, where k ≪ d. p. 2 The controller selects 0 ≤ βt ≤ βmax by finite backtracking. p. 3
Restricted Knowledge Geometry Modeling
RKG constructs a taskspecific, low-dimensional risk geometry from paired restricted and sanitized trajectories before deployment. The process involves several steps to define the geometry:
-
Paired contextual trajectories are constructed for each restricted sequence xFi ∈ F, along with a sanitized reference xSi that preserves shared high-level context and non-target content but omits target-specific details. p. 2
-
Low-dimensional invertible coordinates are learned by normalizing each state as he = (h − µ) ⊘ σ. p. 2
-
The normalized state is projected into target-related coordinates p and their orthogonal residual r, then transformed p with an invertible map ψ: Rk → Rk. p. 2
-
The decomposition is defined as he = r + Uψ−1(z), where z = ψ(p). p. 2
Stateful Boundary Control Mechanism
The controller maps ht to zt and evaluates st = s(zt). If st ≤ τ, the hidden state is unchanged and the history decays as mt = γmt−1. p. 3 If st > τ, the controller applies a boundary correction described below. p. 3 The update step dt is defined as dt = Normalize(−nt + λmPtmt−1). p. 3 This update combines normal descent with tangential state memory to maintain temporal consistency without opposing risk reduction. p. 1
Key Results and Trade-offs
Across three benchmarks, ST2U achieves leading overall trade-offs, with 80.6–87.9% forgetting rates while preserving 90. p. 17% non-target capabilities on average. p. 1 ST2U limits restricted knowledge re-entry to 13. p. 076–19.84%, versus 46. p. 050–59.10% for leading test-time baselines. p. 1 The results demonstrate that target-specific state control plus residual preservation performs consistently across architectures and knowledge formats, including different backbones and long-form continuation. p. 5 ST2U achieves the lowest Avg. p. 6 WMDP accuracy (29. p. 426) and the highest retained MMLU accuracy (60. p. 658) among all unlearning methods. p. 5
Conclusion
Our work revisits test-time unlearning from a trajectorycontrol perspective. We introduce ST2U, which models restricted-knowledge boundaries in low-dimensional invertible coordinates, preserves orthogonal non-target structure, and dynamically maintains a shared correction state according to the evolving generation context. p. 6 The resulting framework provides a unified runtime control mechanism with target-specific geometries across heterogeneous forgetting scenarios while reducing re-entry, layer brittleness, and utility degradation relative to existing methods. p. 6 Our results suggest that stateful, boundary-aware trajectory control offers a practical and effective paradigm for restricted-knowledge unlearning in large language models delivering strong forgetting-retention trade-offs, lower knowledge re-entry, and stable behavior across benchmark probing and long-form continuation tasks. p. 6 Future work will study sparser trigger policies and adaptive intervention schedules to reduce online overhead while maintaining forgetting effectiveness and non-target utility. p. 6
Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.
Improvements for AI systems
-
Stateful Test-Time Unlearning via restricted knowledge boundary control (ST2U) enables trajectory-wide risk control across tokens rather than independent pointwise corrections, which mitigates restricted knowledge re-entry by using
past corrections to reduce later violations.
-
ST2U constructs a restricted knowledge risk geometry in low-dimensional invertible coordinates while preserving the orthogonal complement of non-target components, allowing the model to
preserve non-target capabilities and limiting inference overhead.
-
During inference, ST2U applies normal descent with a tangential state update to move risky states below the boundary, ensuring that "the post-control state is h't = ht(∆h<t) + ∆ht" and coupling per-position constraints along the generation trajectory.
-
Contextual anchoring in ST2U involves anchoring the corrected state toward a contextual reference, such that
residual preservation and contextual anchoring limit semantic drift.
-
The framework provides a
unified runtime control mechanism with target-specific geometries across heterogeneous forgetting scenarios,
leading to astrongest or second-strongest retain performance among testtime unlearning methods while remaining competitive on forgetting.
Sources
- Who's Harry Potter? Approximate Unlearning in LLMs
- A Comprehensive Survey of Machine Unlearning Techniques for Large Language Models
- Measuring Massive Multitask Language Understanding
- Beyond Linear Activation Steering: Invertible Latent Transformations for Controlling LLM Behavior
- Agents Are All You Need for LLM Unlearning
- FUPareto: Bridging the Forgetting-Utility Gap in Federated Unlearning via Pareto Augmented Optimization
- Qwen3 Technical Report
- UniErase: Towards Balanced and Precise Unlearning in Language Models
- Qwen3Guard Technical Report
Related papers
- A Physics-Regulated Neural Framework for Learning 3D Grain Growth Dynamics
- FlexMoE: Learning One-for-All Multi-Budget Expert Pruning for Flexible MoE Deployment
- OptiMind: Improving Small Language Models for Optimization Modeling through Formulation Guidance and Multi-Turn Learning
- Staying in the Sweet Spot: Boost Reasoning Evolution via Responsive Rollout Difficulty Manipulation
- Examining the Impact of Data and Training Methods on Emergent and Subliminal Misalignment
- Rethinking Black-Box On-Policy Distillation: A Rubric-based Analysis