Multi-agent systems lose evidence when the workflow graph cannot carry it, so one run added a single edge at a time
AspireAI community · arXiv (Yaxin Gong, Chongming Gao, Gangyi Zhang)
In multi-step web tasks the communication graph of a fixed workflow decides which agents can read which outputs, so evidence fetched by one agent may never reach the agent that needs it, leaving an information gap and a wrong or incomplete answer. Adding a connection can fix that but also let a receiver adopt an incorrect upstream conclusion that displaces a correct one, and the final output alone cannot separate the two. SPLICE locates a possible gap per query, adds one directed edge from source to receiver, re-executes the receiver and downstream nodes, and then decides adoption by reading both runs' final answers plus the process change the edit caused inside the workflow. A selector trained on those process features chooses between the candidate and the original answer. On five benchmarks SPLICE raises the task score on web tool use by 8.0 percent and the mean score on four reasoning and planning benchmarks by 5.7 percent over the static skeleton, at 1.25 to 1.44 times the skeleton's cost, and transfers zero-shot to four unseen backbones.
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.