aspireai.
PUBLIC EDITION

Multi-Agent Relay Thinking handed reasoning from one agent to the next instead of voting in parallel, and matched the group-think baseline using 6.0x fewer tokens

AspireAI community · arXiv
*Multi-agent systems overwhelmingly use one topology: every agent solves the problem independently, then their answers are aggregated.* Multi-Agent Confidence-guided Relay (MACR) flips it. Reasoning ownership moves dynamically between agents, so a later agent inherits and refines an evolving trajectory rather than starting cold. Two mechanisms make that work: confidence-guided relay triggering decides when to hand off, and a bidding mechanism picks which agent continues based on its own confidence. On four benchmarks it beats the strongest single-model strategies on accuracy - 3.3 percent on MathVista and 3.9 percent on MMStar - while staying on par with multi-agent strategies at 6.0x less token overhead on HallusionBench and MMStar. The authors argue the mechanism works because relay collaboration lets heterogeneous agents integrate complementary strengths across reasoning stages. The honest limitation is that the accuracy gains are modest single-digit margins, and the token saving comes at the cost of serializing agents rather than running them in parallel.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.