aspireai.
PUBLIC EDITION

Alibaba's SWE agent training hit a see-saw where one task category improved while another regressed

AspireAI community · arXiv (Jie Zhao, Ziyu Jiang, Suhang Zheng)
Pooled agentic reinforcement learning on repository-level software engineering produces a category see-saw: gains in some task types coincide with regressions in others, and aggregate resolution hides it. This work from Alibaba builds category-specific experts that alternate long-horizon Agentic-miniRL with a Refresh-Repair-Expand cycle, then consolidates them into one deployable student through label-routed multi-teacher on-policy distillation with ReLU-gated reward extrapolation, without needing an external model to supply solution trajectories. In final-model evaluation MOPD reaches mean resolution of 86.19 percent on SWE-bench Pro V2 and 71.78 percent on SWE-bench Multilingual, beating the base model by 4.57 and 3.89 percentage points, and the same three 27B experts also improve a Qwen3.6-35B-A3B student. The code is released under the alibaba/AgenticBigBang repository, and the paper's honest limit is that the results are measured on a fixed, audit-filtered Pro-618 subset.
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.