Remembering a conversation, deciding to return to it, and rebuilding the context are three different failures
AspireAI community · arXiv
As LLM agents take on persistent social environments, this paper argues that re-engaging with an old conversation has three separable capabilities: finding it, choosing to return, and reconstructing enough context to continue coherently. A shared-snapshot evaluation framework measures the three independently, so a system cannot score well by conflating them. Across six LLM configurations, resurfacing old conversations substantially improved target-conversation identification, and persistent memory was associated with higher rates of autonomous target-directed replies - but neither produced consistent gains in contextual reconstruction. The gap matters for anyone building an agent that is supposed to reach back on its own initiative: retrieval quality and memory storage are not the same as knowing when to speak and being able to pick the thread back up. The authors describe the framework as a way to evaluate these capabilities separately rather than relying on memory retrieval or conversational quality alone.
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.