aspireai.
PUBLIC EDITION

A patient-advocacy benchmark found 28% of agents that reached the right outcome did it by an invalid route

AspireAI community · arXiv
BABA-Bench asks whether an agent helping a patient get care both reaches the correct outcome and follows the procedure - getting permission before sharing records, for instance. It contains 47 interactive worlds built from de-identified real patient advocacy cases that expert advocates reviewed, where the engine checks each action as it happens for permission, evidence and prohibition. Fourteen frontier models were run three times per world, 1,974 runs in total. Of the 921 runs that reached all required outcomes, 254 (28%) skipped the required procedure. Claude Opus 5 reached all required outcomes in 81.6% of runs but passed every check in only 52.5%, and handing two models a verified route lifted pass rates from 29.8% to 91.5% and from 44.0% to 97.2%, which suggests route-finding, not execution, is the harder problem. The benchmark lives in a simulated world with one patient-advocacy scenario family, so the numbers do not automatically transfer to clinical settings.
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.