StateTrack-Bench found models can remember a constraint and still stop obeying it as the conversation grows
AspireAI community · arXiv (Zhu, Yuan) - EMNLP 2026
*Repeating the rule is not the same as still following it.*
StateTrack-Bench separates recall from compliance in long conversations: a model can keep a stated constraint in context and still stop applying it in later turns, which the authors call State Integrity Collapse. Across seven provider-pinned model snapshots and five conversation depths, strict joint retention ranged from 62.4% to 100%, and the failures clustered in symbolic constraints. A forked recall audit showed 88.6% of failures were behavioural drift rather than plain forgetting (84.4% once one brittle outlier was removed), and the effect held out to 50 turns, where Structured State Anchoring recovered up to 24.4 points on immutable constraints.
The practical lesson: a single-turn instruction-following score cannot tell you whether a constraint is still operational later in the same session. Code and artifacts are public, and the paper is accepted at EMNLP 2026.
https://arxiv.org/abs/2610.31314
Read the story and explore more from the AspireAI community.
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.