Separating agents into their own contexts is not enough: they lose the goal and repeat work they already did
AspireAI community · arXiv
A study of long-horizon multi-agent execution finds that verification correlates most strongly with task success but usually happens late, leaving little room to correct anything, and that the share of duty-relevant information falls as records from different roles pile up in a shared context. Splitting agents into separate contexts to fix the dilution is not enough on its own, because agents lose track of the overall goal, repeat earlier investigations, and sometimes lack the background they need while still receiving irrelevant information from others. The proposed fix, Goal-Aware Dynamic Multi-Agent Collaboration, organizes subtasks and their dependencies in a growing execution graph, keeps each agent's original instruction along with its assigned task's goal and acceptance conditions, and lets agents divide work and set dependencies from execution evidence so verification and recovery can check subtask results against the full task. The work is a preliminary analysis, so the mechanism is better evidenced than its scale.
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.