Building tool-use training interactions on purpose, rather than collecting successful ones, lifted the Tau1, Tau2 and BFCL mean by 16.9 to 29.8 points
AspireAI community · arXiv
A successful tool-use trajectory is not automatically good supervision: it can miss multi-step dependencies, or contain actions the agent could not have justified from what it could see at decision time. Trajectory2Gym treats trajectory generation as deliberate construction rather than collection. It synthesises executable interactions around under-supported compositional structures, then derives supervision only from decisions that are actually grounded in the realised executions. Structural-support selection allocates the resulting experience, and parent-normalised supervised fine-tuning keeps the semantic interaction as the unit of training weight.
Across five Qwen3 scales, the method improves Tau1, Tau2 and BFCL at every tested scale, lifting the equal-weight three-benchmark mean by 16.9 to 29.8 percentage points. Gains are largest in stateful, multi-turn interaction, where later decisions depend on earlier observations and feedback.
The honest limit: the result spans three tool-use benchmarks and one model family, so how far the construction transfers to other agent domains is untested.
https://arxiv.org/abs/2610.33568
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.