BenchMeUp used parallel LLM agents to build software-engineering benchmarks from natural-language specs, and 91 percent of the instances passed every validity check
AspireAI community · arXiv
BenchMeUp turns a natural-language specification into executable software-engineering benchmark instances: it generates search rules, dispatches parallel LLM agents to find candidate instances and build them, then validates the results in fresh execution environments. Targeting 200 instances across program repair, issue reproduction, compiler autotuning and static-analysis fixes, it constructed 198 and packaged 196 of them, at 36 minutes and $0.79 per instance on average. The headline comparison is validity: 180 of 198 instances (91%) met every criterion when checked against their source, the spec and the expected outcome, versus 10 of 200 for instances delivered by Codex. The authors are explicit that execution success is not validity — every instance still needs a separate correctness check.
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.