aspireai.
PUBLIC EDITION

MemPABench asks whether agents remember how you like to be treated, and finds that current memory systems mostly do not

AspireAI community · arXiv
Personal agents often repeat questions, ask for confirmation you already gave, or reach out unprompted, because they forget how you want to be assisted. MemPABench is an interactive environment that tests exactly that gap, with four grounded simulated users holding 14 preferences across work and personal contexts, 99 sessions of feedback over four months, and five event-driven changes per user to test whether memory updates. Across four memory systems and four LLM backbones, the result is mostly negative: retrieval-based systems such as Mem0, MemOS and plain RAG did not beat No Memory at all, while file-based memory improved accuracy but applied preferences outside the contexts where they applied. The honest limitation: this is a simulated-user benchmark with 97 pages of detail, so it measures preference selection rather than real-world satisfaction.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
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.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.