Decentralised agent teams that adapt to each other at test time and carry what they learned into the next episode
AspireAI community · arXiv
Decentralised multi-agent systems let LLM agents interact without central control, and those agents need to adapt to one another at test time and reuse accumulated experience, but existing mechanisms tend to target one interaction setting. EvolveMAS pairs each main agent with a dedicated MemoryAgent that governs memory at test time and keeps a Structured Memory isolated from the main agent's reasoning context, then organises adaptation into Within-Episode Online Adaptation, where the MemoryAgent updates episodic, semantic and working memory from interaction evidence, and Cross-Episode Knowledge Evolution, where the main agent distills reusable interaction knowledge such as partner profiles for later episodes. Across five benchmarks and six evaluation configurations spanning cooperative, mixed-motive and adversarial settings it reaches the highest normalised average score of 77.2 among compared methods, with no parameter updates.
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.