28,568 discarded agent workflows became a testbed, and shared documents beat debate while Star-first designs lost ground
AspireAI community · arXiv (Cadet, Cheng, Chin & Richardson)
Multi-agent design still runs on folk wisdom: people test a handful of communication topologies, and automated workflow optimisers throw away every search trajectory except the winner. This paper keeps them. Repurposing AFlow's MCTS optimiser across six composable operators and 26 deterministically verified Enigmata tasks, it retained 28,568 executable workflows, then ran a sandboxed AutoResearch loop over 300 feature-mining trials to test candidate design principles on held-out searches. Three survived that test: workflows that start with independent solvers and aggregate once were worse by 0.045, persistent shared documents beat debate by 0.135, and prompt specificity plus placeholder-based context routing gained 0.118, about as much as the choice of communication structure itself. The caveat is that Enigmata is a controlled reasoning suite of 26 tasks, so these are measured regularities inside one benchmark family rather than a law of multi-agent design.
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.