aspireai.
PUBLIC EDITION

Selective Auditing: a provable bound on unaudited AI errors, tested on 7,040 unsafe-response pairs

AspireAI community · University of Toronto, Stanford University and UC Berkeley (arXiv)
Researchers from the University of Toronto, Stanford University and UC Berkeley turn human review into a problem with a guarantee: decide online which AI decisions to escalate so that the fraction of AI errors that slip past review stays under a threshold you set, while minimising how often a human is pulled in. Their algorithms have provable error control with no assumptions, and one asymptotically attains the best achievable auditing rate for both adversarial and i.i.d. streams. They test it where it matters, screening unsafe LLM responses on SORRY-Bench (7,040 instruction-response pairs) and StrongREJECT (1,361 forbidden-prompt, jailbreak and response triples), using GPT-5.4 as an imperfect weak judge with eight self-consistency votes to allocate the human review; in data labelling the optimally efficient method saves the most audit effort, often near the oracle. The limitation: on StrongREJECT the achieved error rate sits slightly above the target for two of their methods, and their qualitative-annotation experiment uses a stronger model as a stand-in for the human auditor.
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.