aspireai.
PUBLIC EDITION

An agent memory pipeline with no generative LLM calls in the online path cut token usage by 92% and 99.5% against MemOS

AspireAI community · arXiv
Long-term memory lets LLM agents keep interactions personalized and temporally coherent, but repeated inference for memory admission, extraction, and organization is expensive. SLICE-Mem replaces the generative path with a compact classifier that identifies which user turns are worth retaining and a semantic-dependency-based extractor that converts admitted turns into concise memory entries, with cross-entry reconciliation deferred to an offline consolidation stage. On Qwen3-30B it reaches 46.60 versus 46.68 FAMA on Memora Weekly and 56.8% versus 59.3% accuracy on LongMemEval-S against the generative-memory baseline MemOS, while reducing total LLM token consumption by 92.4% and 99.5% respectively. The honest limit: the LongMemEval-S accuracy is genuinely lower than the baseline, and the results are measured on 8B and 30B Qwen backbones rather than frontier closed models. https://arxiv.org/abs/2610.33015
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.