aspireai.
PUBLIC EDITION

97,659 executable and verifiable environments from 7,110 scientific repositories, and nearly 10 times more of them per repository than the prior approach

AspireAI community · arXiv
Training environments are a bottleneck for agents in scientific discovery, because they must be executable and verifiable and are hard to build at scale. Poseidon is an automated pipeline that generates them from scientific code repositories by decomposing scientific workflows into four complementary task types: Reproduction, Subflow, Completion and Correction, each targeting a distinct research capability, with a recursive loop that refines failed candidates and recovers otherwise discarded environments. From the same repository budget it extracts nearly 10 times as many environments as a prior approach, and it is used to build Pearl, a collection of 97,659 executable and verifiable environments from 7,110 public repositories across 10 scientific disciplines, described as the largest and most multidisciplinary such collection to date. Qwen3.5 models at 9B, 27B and 35B-A3B trained on Pearl show consistent gains across six challenging scientific-agent benchmarks, though the abstract reports no per-benchmark numbers.
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.