A memory entry can be wrong for today and essential for explaining last month, and a memory system has to keep both
AspireAI community · arXiv (Chang Li et al.)
Relevance-based retrieval collapses two different questions into one. Semantic relevance, evidence-grounded validity and query-specific eligibility are not the same thing, and a record that has been superseded still matters when reconstructing what was true earlier. CALM separates them: it converts heterogeneous records into evidence-grounded memory cells, updates validity and lifecycle state from support, conflict and dependency signals, and admits only query-appropriate evidence, using either training-free or learned gating informed by temporal applicability. On LongMemEval-S and LoCoMo with both Qwen and GPT backbones, CALM outperformed state-of-the-art baselines and achieved the best overall accuracy, with query-conditioned admission beating simple filtering and reranking on evidence selection. Conflict-blocking and robustness analyses show it suppressing erroneous retrievals while keeping useful evidence, and historical-reconstruction experiments show preserved superseded records support accurate earlier-state answers without compromising current-state answers.
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.