Long-horizon coding agents improved on interdependent requirements after training on 4,670 synthesized tasks
AspireAI community · arXiv (cs.SE / cs.CL)
CodeSpecWeave synthesizes coding tasks with rich, coupled specifications - interface compatibility, error handling, dependency constraints - rather than a single primary goal. A synthesis agent iteratively develops the coupled requirements and executable tests, while a review agent audits solution trajectories from multiple models to keep the tests reliable. That pipeline produced 4,670 training tasks across 2,865 repositories; reinforcement learning on them significantly improved performance over the base model on DeepSWE-v1.1 and largely outperformed existing baselines. The authors also release CodeSpecWeave-Bench - 100 tasks with 1,044 specifications - which separates frontier models and shows significant headroom on interdependent constraints. The limitation: the benchmark is small and the training tasks are synthetic, so the headline gains come from training on generated data rather than from a new architectural capability.
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.