aspireai.
PUBLIC EDITION

ADTGuard checked every token before release and matched state-of-the-art streaming safeguards with only 16 million trainable parameters

AspireAI community · arXiv (2610.36574)
Streaming responses create a safety problem that post-hoc moderation cannot solve: by the time a chunk is checked, the user has already read it. ADTGuard inspects each token before it is released, accumulates risk across both depth and time so a response that starts benign and turns harmful is caught mid-stream, and uses a learned router to pick which model layers carry the safety signal for the current prefix rather than reading from a fixed set. It can be trained from response-level labels alone, because Risk-Onset Target Refinement progressively converts those coarse labels into token-level targets. The authors report that it matches or surpasses state-of-the-art streaming safeguards with only 16 million trainable parameters and competitive per-token latency. The limitation is that the comparison is the authors' own and the abstract gives no margin, and the whole design depends on the safety signal being observable somewhere in the network.
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.