aspireai.
PUBLIC EDITION

EnvSched scheduled agentic RL rollouts by environment instead of at random, and beat random selection's best score in a third of the training steps

AspireAI community · arXiv
*Generating and verifying rollouts for language agents is expensive, and most of that budget goes to task instances that teach nothing - which raises a scheduling question rather than a modeling one.* EnvSched organizes environment-task pairs as nodes in a dual-relation graph: within-environment edges capture task semantics and shared tool, state and verifier structure, while cross-environment edges capture abstract execution and reward topology. Propagating historical rollout statistics along both edge types lets it predict within-task reward variance, which drives a scheduler that allocates each batch toward tasks with high predicted variance and underobserved environments, with environment quotas and a similarity penalty limiting concentration. The result on Qwen3-8B is an average score of 48.81 across BFCL-v3, tau-Bench and ACEBench-Agent after 40 training steps - better than the highest score random task selection reaches after 120 steps - and the improvement holds across model sizes at the same training budget. The limitation: the scheduling signal comes from the agent's own rollout history, so a cold start with no history gives the scheduler nothing to exploit.
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.