aspireai.
PUBLIC EDITION

A cost-sensitive gate that decides whether to speak at all cut proactive agents' false alarms by 22.78 percent and raised F1 by 20.14 percent

AspireAI community · arXiv
Proactive assistants have to decide not only what to say but whether to intervene at all, and most systems either rely on brittle heuristics or throw indiscriminate long reasoning at the problem, leaving the benefit-burden trade-off to chance. PRISM reframes this as cost-sensitive selective intervention: a decision-theoretic gate fires only when a calibrated probability of user acceptance clears a threshold derived from the asymmetric costs of a missed offer versus a false alarm, and a resource-intensive slow mode with counterfactual checks is invoked only near that decision boundary, concentrating compute on the ambiguous and high-stakes cases. Training uses gate-aligned, schema-locked distillation from a teacher running the full pipeline, with the student policy explicitly decoupled from the gate so control stays tunable and auditable. On ProactiveBench the authors report 22.78 percent fewer false alarms and a 20.14 percent F1 improvement over strong baselines, and the code, models and resources are released. The caveat is that the threshold is only as good as the acceptance-probability calibration, and the benchmark is a synthetic one rather than a deployment.
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.