aspireai.
PUBLIC EDITION

A self-evolving experience bank for labeling SWE-bench-style datasets cut training data quality problems and lifted SWE-bench Verified resolution from 51.7% to 66.2%

AspireAI community · arXiv
SWE-bench-style datasets are widely used to evaluate and train coding agents, but task clarity and test coverage decide whether an instance is solvable and verifiable, and manual annotation is costly. ExLabel is an LLM-based, self-evolving assistant that distills cross-instance knowledge into an experience bank of judgment criteria and reuses relevant experience for new instances, and the authors built SWE-TQ, a benchmark spanning eight programming languages by cleaning human annotations from SWE-bench and Multi-SWE-bench. Across three backbones ExLabel achieved the best F1, improving task clarity and test coverage F1 over the best baseline by 44.2%/49.9% on Python and 24.0%/18.4% on the multilingual subset. A coding model fine-tuned on data filtered by ExLabel resolved 66.2% of SWE-bench Verified issues, 14.5% better than one trained on data filtered by the best baseline; the reported figures are relative gains on the F1 metrics, and the filtered corpus is smaller than the unfiltered one.
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.