aspireai.
PUBLIC EDITION

Searching 7,354 randomized trials by structured labels recovered 45 percent of the evidence a systematic review would include, while embedding retrieval followed by model filtering found 92 percent

AspireAI community · arXiv (cs.CL)
Many AI systems have to find every relevant item in a large collection and then organise what they found, and the usual approach of tagging items with labels from a curated vocabulary and searching on those labels misses items that do not fit a label and returns too much when labels are broad. This paper compares that label search against an embedding-based approach that finds candidates by meaning and then has a language model keep only the relevant ones, over a corpus of 7,354 randomised trials. Label search found 45 percent of the evidence a systematic review would include, while the two-stage approach found 92 percent, at a cost per query that rises with search depth. The result argues for broad candidate retrieval followed by query-specific evidence filtering rather than taxonomy search, and the depth-dependent cost is the tradeoff the paper leaves open.
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.