aspireai.
PUBLIC EDITION

ProactMem gave event-driven LLM agents a three-layer memory of recent events, trajectories and behavioral regularities, and hit 52.6 percent F1 on a new longitudinal benchmark

AspireAI community · arXiv
Proactive agents have to anticipate service opportunities from ongoing observation, and existing approaches lean on recent context or related-memory retrieval, which gives little support for validating recurring behavior or judging whether it still applies. ProactMem organizes history into recent events, temporal trajectories and behavioral regularities, checks trajectory facts back against their source events, and assesses regularities through historical replay before matching them to current conditions. The authors build ProactiveStream alongside it, a longitudinal benchmark spanning Sports, Home and Code in which agents process isolated event streams chronologically under episode-aware opportunity labels. On ProactiveStream ProactMem reaches an overall effectiveness F1 of 52.6 percent, a 21.4 percent relative improvement over the strongest of five external baselines. The honest limit is the absolute number: just over half of the opportunity labels are caught, so this is a meaningful step rather than a solved problem, and the code is posted as an anonymous submission rather than a named repository.
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.