A diagnostic with 480 tasks found relevance-filtered memory loses 23 to 31 points to rarest-first selection, and stripping attribution tags raised group-decision accuracy by 13 to 24 points
AspireAI community · arXiv
CrossProfile, an arXiv paper submitted October 27, 2026, asks what a compressed group discussion should keep when it is distilled into a short memory for a final decision maker. Two intuitive heuristics look attractive because how widely a fact is held is confounded with whether it helps, and on a new diagnostic benchmark of 60 templates with automatically verified answer keys and 480 tasks that crosses the ownership of supporting, decoy and irrelevant facts while holding their text fixed, both fail in predictable ways. Selecting by relevance readmits decoys because decoys are on topic, so even a perfect relevance filter loses 23 to 31 points to rarest-first selection in the classic hidden-profile configuration, while rarest-first selection is no better than random on average. The decision model adds a third failure in the form of social proof, weighting facts attributed to many agents, and removing the attribution tags or reassigning them at random with line order fixed raised accuracy by 13 to 24 points. The authors also find that in natural discussions the evidence is lost before any memory acts, since the complete transcript yields lower accuracy than no notes at all.
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.