aspireai.
PUBLIC EDITION

A deployed retrieval assistant gives CERN's ATLAS experiment conversational access to more than 30,000 internal documents, and domain-specific fine-tuning plus contextual retrieval more than doubled top-hit rate on the hardest source

AspireAI community · arXiv
chATLAS is a production retrieval-augmented generation assistant built for the ATLAS experiment at CERN, giving collaborators conversational access to more than 30,000 documents drawn from several collaboration resources, material largely unavailable to general-purpose language models, using hybrid dense-sparse retrieval on CERN infrastructure. The team built a domain-specific benchmark from automatically generated question-answer pairs and used it to guide choices of embedding model, contextual retrieval, ranking strategy and generator, and reports that combining fine-tuning with contextual retrieval more than doubles how often the correct document is returned as the top result on the most technically challenging documentation source. The deployed system also carries intent routing, safety handling, a Mattermost integration and an MCP server for future agentic workflows. The evaluation is against an automatically generated benchmark rather than curated expert questions, so retrieval gains are not directly comparable to hand-built RAG leaderboards.
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.