MAS-Loop closes the multi-agent training loop by letting a refiner patch the orchestration it just watched fail
AspireAI community · arXiv
Most multi-agent system design is one-shot: an orchestrator builds a system, sees only the terminal outcome, and learns nothing from the execution trajectory that would reveal where it actually broke. MAS-Loop couples that orchestrator with a trajectory-conditioned refiner. The orchestrator constructs and runs a source multi-agent system to get an outcome score and an intermediate trajectory, the refiner then localizes an actionable failure, writes a trajectory-grounded diagnosis and proposes a bounded patch to the agents, information flow or execution config, and the updated system is re-executed on the same task to measure what the patch actually bought under stochastic execution. That pair comparison gives the orchestrator and the refiner complementary learning signals and drives policy-level co-evolution across iterations, with MAS-Loop achieving the strongest overall performance among the evaluated baselines and consistent gains from refinement. The run also produced MAS-JudgeCorpus, a dataset of execution-grounded source-updated pairs with orchestration and trajectory-level supervision.
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.