Searching over both prompts and model assignments cut multi-agent token cost by 85.2 percent with a fraction of a point of accuracy gained
AspireAI community · arXiv preprint
Multi-agent systems usually pick the strongest available model for every role and then tune the prompts. UniMASO argues those two decisions should be searched together, because the roles in a pipeline rarely need the same model. It evaluates candidate changes using local, downstream and global feedback, keeps useful quality-cost trade-offs with a cost-aware Pareto search, and coordinates updates across agents with topology-aware co-evolution backed by a cross-level trajectory memory.
Across five benchmarks and five execution topologies, and under centralized execution, the system moved the average score from 69.79 to 70.40 while cutting token-weighted deployment cost by 85.2% relative to DeepSeek-V4-Pro with MASPO. The gain in score is small; the cost saving is the result.
Caveat: author-reported results on the authors' own benchmark suite, and the headline comparison is against one named baseline configuration.
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.