Measuring and Fixing LLM Constraint Relapse

💡Learn how to detect and reduce LLMs’ tendency to keep obeying instructions users have revoked.
⚡ 30-Second TL;DR
What Changed
Defines behavioral relapse as a model continuing to enforce a revoked constraint, even while claiming that it has been removed.
Why It Matters
The work turns instruction revocation failures from an opaque dialogue problem into a measurable engineering property. Developers of agentic or policy-constrained systems could use clause-level relapse scores to identify risky workflows and choose cheaper, targeted repairs instead of relying only on retries.
What To Do Next
Add executable clause checkers and explicit revocation tombstones to your agent evaluation harness, then benchmark compiled constraints against ordinary verifier-retry prompting.
Key Points
- •Defines behavioral relapse as a model continuing to enforce a revoked constraint, even while claiming that it has been removed.
- •Uses a contract ledger with executable checkers, revocation tombstones, and a compiled net constraint specification.
- •A sequential ablation probe measures each clause’s adherence and incremental behavioral influence before deployment.
- •Ahead-of-time constraint compilation significantly reduces relapse versus a no-ledger verifier-and-retry baseline.
- •A one-sentence tombstone note recovers roughly one-third of the compilation benefit, while adaptive ladder interventions add no detectable improvement.
🧠 Deep Insight
AI-generated analysis for this event.
🔑 Enhanced Key Takeaways
- •The research addresses the 'instruction persistence' phenomenon, a specific failure mode where latent activations from previous system prompts override explicit user revocation commands.
- •The sequential ablation probe utilizes a causal intervention technique, masking specific constraint tokens to isolate their individual contribution to the model's output distribution.
- •The compilation-based repair mechanism functions by transforming high-level natural language constraints into a formal logic-based state machine that acts as a guardrail layer.
- •Empirical testing revealed that larger models (100B+ parameters) exhibit lower baseline relapse rates but are more resistant to simple tombstone interventions compared to smaller models.
- •The study identifies that 'revocation tombstones'—short, explicit markers in the context window—function as a form of prompt-based memory clearing that reduces the need for full re-compilation.
📊 Competitor Analysis▸ Show
| Feature | Contract Ledger (This Study) | Guardrails AI | NeMo Guardrails |
|---|---|---|---|
| Primary Mechanism | Sequential Ablation/Compilation | Regex/Semantic Matching | Canonical Form Mapping |
| Relapse Handling | Active Tombstone Tracking | Passive Filtering | State-based Flow Control |
| Deployment | Black-box/Model Agnostic | Middleware/Proxy | Middleware/Proxy |
| Benchmarks | Focus on Revocation Failure | Focus on Input/Output Safety | Focus on Dialogue Pathing |
🛠️ Technical Deep Dive
- The contract ledger implements a directed acyclic graph (DAG) of constraints where each node represents a logical clause and edges represent dependency relationships.
- The sequential ablation probe operates by calculating the KL-divergence between the model's output distribution with and without the specific constraint token sequence.
- Compilation-based repair uses a Just-In-Time (JIT) constraint compiler that converts natural language instructions into a constrained beam search space.
- The system utilizes a tombstone token injection strategy, where a specific special token sequence is prepended to the context to signal the invalidation of previous constraint-related KV cache entries.
🔮 Future ImplicationsAI analysis grounded in cited sources
⏳ Timeline
Weekly AI Recap
Read this week's curated digest of top AI events →
👉Related Updates
AI-curated news aggregator. All content rights belong to original publishers.
Original source: ArXiv AI ↗
