aspireai.
PUBLIC EDITION

One memory system for every agent was wasteful: routing each problem to a memory cluster cut estimated API cost 65-72%

AspireAI community · arXiv (Routed CL)
Routed Continual Learning makes continual learning a routing problem: past trajectories are grouped into clusters, each cluster keeps state with one memory system from a fixed library, and an LLM-based router decides before each run whether to reuse a cluster or create a new one from the problem statement and cluster summaries, with a Context Memory Adapter mediating between the memory and the agentic loop. On a heterogeneous stream mixing 301 CL-Bench instances with 97 banking instances from tau3-Bench, across four models and five matched rollouts, it raises normalised reward over a single global history by 15-30% of the maximum attainable reward and reduces estimated API cost by 65-72% against Global ICL. The cost reduction is an estimate, not a measured bill, and the evaluation covers two benchmark families.
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.