aspireai.
PUBLIC EDITION

Scientific protocol retrieval is hard: the best retriever scores nDCG@10 of 0.290, and reranking only reaches 0.474

AspireAI community · arXiv (cs.IR, cs.AI, cs.CL)
Reproducing an experiment means retrieving a protocol that satisfies several interdependent constraints, and existing benchmarks do not test that systematically. ProSearch is a benchmark for multi-constraint protocol retrieval in experimental science, built from real experimental records and expert-defined templates with 60 experimental fields and their dependencies, and 3 to 5 explicit constraints per query including numerical and negation constraints. It contains 1,515 queries across six experimental science domains. Across 19 representative retrievers the best performer reaches an average nDCG@10 of only 0.290, improving to 0.474 with reranking. Structured diagnostic analysis shows explicit constraint matching is a strong ranking signal, while manual error analysis identifies joint constraint binding as the key bottleneck. Accepted to NeurIPS 2026 Evaluations and Datasets Track, with code and data released.
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.