Routing multi-task code reinforcement learning by each task's measured utility beat the best task-specific specialist by 9.0 to 9.5 percent
AspireAI community · arXiv
Training one specialist per coding task scales badly, and existing multi-task reinforcement learning treats every task alike with a fixed data curriculum under a shared optimization strategy. ASTOR centers training on a task-utility signal that captures both a task's learning potential and its synergy with the others, and couples two modules around it: a hierarchical utility-routed data scheduler that allocates training budget and prioritizes informative prompts, and an adaptive utility-calibrated policy optimizer that scales each task's KL regularization to that task's current training state. Across two widely used LLMs and four representative coding tasks the authors report a single model improving on every task, outperforming the best task-specific specialist by 9.0 to 9.5 percent and the strongest multi-task RL baseline by 7.5 to 12.8 percent. The caveat is that the utility signal is an estimate, so the method inherits whatever error the utility estimator makes about which tasks are worth spending on.
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.