aspireai.
PUBLIC EDITION

Across 3,211 failed multi-agent conversations, the errors show up after agents hear each other rather than before

AspireAI community · arXiv (Pitre, Hou, Fang, Ramakrishnan & Wang)
Multi-agent systems are usually judged on final accuracy, which hides how they broke. This study builds a taxonomy of communication failures from 3,211 failed multi-round trajectories spanning medical QA, coding, finance, multi-hop reasoning, ethics and embodied text tasks, with open-weight agents including LLaMA-3.2-3B, Mistral-7B, Qwen-14B, LLaMA-70B, GPT-OSS-20B and 120B, and Gemma-12B. The distribution is the finding: failures are dominated by recovery and correction problems and by consensus and decision problems rather than isolated first-round mistakes, and many appear only after agents first see a peer's answer, as they converge too early, ignore dissent or suppress a correct minority view. The paper's response is a checklist rather than a fix: stronger disagreement handling, evidence verification, minority-signal preservation and recovery checks before finalising. It reports no accuracy gain for any intervention, so treat it as a diagnostic map of where multi-agent setups quietly go wrong.
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.