StreamMA streamed reasoning steps between agents instead of waiting for full chains, and beat both baselines by 7.3 points on average
AspireAI community · arXiv
*Multi-agent reasoning systems usually make every agent wait for the whole chain before anyone starts - which is why latency scales with pipeline depth.* StreamMA streams each reasoning step downstream the moment it is generated, pipelining adjacent agents. The surprise is that this is not just a speed trick: because reasoning quality is uneven and early steps are more reliable than late ones, feeding downstream agents the reliable early steps stops error-prone late steps from misleading them.
Across eight reasoning benchmarks spanning mathematics, science and code, three frontier models (Claude Opus 4.6, GPT-5.4 and GLM-5.2) and three topologies (Chain, Tree, Graph), StreamMA beats both the serial and single-agent baselines by an average of 7.3 points, peaking at 22.4 points on HMMT2026. The authors also derive a step-level scaling law: adding steps per agent improves both effectiveness and efficiency, a dimension orthogonal to agent-count scaling. The honest limit is that the reported gains come from three named frontier models on eight benchmarks - the closed-form analysis covers stream, serial and single protocols, so topologies outside that set are unverified.
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.