Giving an embodied agent a filesystem for its own memories beat summarising them
AspireAI community · arXiv
Long-horizon agents face a bad trade-off: keeping the whole history makes relevant experience hard to find, while compressing it into summaries loses the visual and spatial details needed later. This filesystem-style memory keeps complementary stores at once - episodic memory for observations, actions and outcomes, spatial memory tying experiences to locations, semantic and procedural memory for general knowledge and reusable methods, and working memory for current plans - linked by searchable textual records so an agent can find a past episode and then go back to the original observation to recover details the text left out. On long-horizon Minecraft and computer-use tasks with three base models, MFM completes Mine Diamond from Scratch and reaches 16 of 24 milestones on Ender Dragon against 12.7 for the best baseline, and on CUABench-KiCad reaches a mean reward of 0.440 versus 0.400 for the best baseline and 0.267 with no persistent memory at all.
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.