An audit of agentic life-science benchmarks found that when a prompt was mostly a name and a candidate list, identity alone drove the answer
AspireAI community · arXiv (Brilli and Georgila)
*Agentic life-science benchmarks give an agent evidence about a named entity and score the answer against a recorded outcome - but that only tests reasoning over evidence if the evidence, not the name, determines the answer.* The authors vary identity and evidence independently on a clinical-outcome benchmark and on published tasks from Biomni and LAB-Bench.
Blinding identity matters little when the prompt contains a decisive sequence or passage, and matters a great deal when the prompt is mostly a name and candidate list: 0.742 named versus 0.082 blinded, with chance at 0.093. Across 96 LAB-Bench LitQA2 questions the gap increases under a fixed passage-redaction scheme, with a per-instance slope of +0.147 (p = 0.004). On the clinical benchmark a no-evidence recall probe matches prediction accuracy and recovers a database-specific programme count. The recommendation is that such benchmarks report identity-blinded results, retrieval telemetry and positive controls.
Read the story and explore more from the AspireAI community.
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.