aspireai.
PUBLIC EDITION

A proactive assistant's hint quality came from its memory, not its size: stripping the memory profile cost 24.7 exact-match points while a bigger generator added nothing

AspireAI community · arXiv (joint gating and memory-grounded hint generation)
Proactive assistants must decide both when to speak and what to suggest, and the usual architecture splits that into a separate gate and a larger generator. This paper evaluates both together over 28,058 decision points, finds that behind a real gate end-to-end exact match reaches 0.2619 against a 0.2971 oracle-gate ceiling, and shows the compute saving from gating falls from 4.39x with an 8B generator to 1.38x with a 1B one, so a gate buys precision and compute only when the generator is large. The memory profile turns out to drive hint quality: removing it costs 24.7 exact-match points and drops rescaled BERTScore from 0.57 to 0.35, while retrieval and a bigger generator add nothing on exact match, and a single 1B decoder that gates from an intermediate layer and generates in the same pass matches or beats the two-model pipelines with 1.31 to 1.76x less wall-clock time. The limitation is that the absolute scores are low, end-to-end exact match is 0.2619 against a 0.2971 oracle ceiling, and the human evaluation rests on 1,144 ratings over 32 dialogues.
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.