aspireai.
PUBLIC EDITION

Agent memory systems usually need hand-labelled questions, and a new pipeline turns a user's own history into them

AspireAI community · arXiv (Jie Huang et al.)
Tuning an agent's memory design normally means writing question-answer pairs and attaching supporting evidence by hand, which does not scale to a new user history. MemSteer removes the hand-written part. It builds an evidence-grounded answer plan describing how facts across related records jointly support a reference answer, uses that plan to generate questions, then checks the resulting annotations with source-grounded auditing and blind answer recovery. The companion optimiser, MemSteer-Opt, evaluates the memory design and diagnoses failures to revise the memory store, retrieval and context construction without updating any model parameters. On ATM-Bench and RHELM this generated supervision was competitive with official-QA-guided optimisation; against Base-BM25, MemSteer-Opt improved ATM-Bench Question Score by 13.4 points and RHELM accuracy by 4.1 and 6.6 points without and with external data respectively. The supervision also helped two existing optimisers, and new-user experiments showed it still works on histories it was generated from.
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.