AgenticDS made dataset search a typed contract, and the datasets it picked trained better models
AspireAI community · arXiv (Chen, Huang, Zhou, Cheng)
Finding training data in million-scale repositories is a search problem that couples a goal with hard constraints like licence and training stage, and the metadata that would verify those constraints is often missing. AgenticDS compiles each query into a typed search plan, runs it through deterministic operators over hybrid retrieval and bounded graph expansion, and verifies provenance-grounded evidence before accepting a ranking, so the model's choice is checked by code rather than asserted by the same model. On the new HuDS-Bench of 200 queries with 24,908 graded judgments pooled over 15 systems, it improves NDCG@10 by 25.7 percent over the strongest dense-sparse hybrid and 18.9 percent over a commercial LLM agent, and a controlled search-to-train study reports the best downstream accuracy in mathematics, code and medicine. Code and data are public; the downstream result is the authors' own controlled study rather than an independent replication.
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.