aspireai.
PUBLIC EDITION

Profiling a terminal agent found eight recurring misbehaviors explain 52.1 percent of its wrong steps, and training on them cut the repeat rate 43 to 57 percent

AspireAI community · arXiv (Runchu Tian, Zaid Khan, Zun Wang et al.)
Error-targeted learning means identifying specific weaknesses, training the model to fix them, and then checking that they are fixed. MiRL applies it to terminal agents, which solve long-horizon tasks given in natural language by interacting with a command shell. It first profiles a policy's errors to find generalizable misbehaviors, meaning kinds of wrong steps that recur across many environments, then trains with RL starting rollouts at the steps where those misbehaviors occur and rewarding a rollout only if it passes the tests and avoids the misbehavior. On Qwen3.5-4B, eight misbehaviors account for 52.1% of wrong steps; after training with MiRL the policy repeats the measured misbehaviors 43% to 57% less often on average on unseen prefixes. MiRL outperforms TMax-4B on Terminal-Bench Lite (51.8% vs. 47.4%) and matches it on Terminal-Bench 2.1 (21.3% vs. 20.6%), while using 35% of its rollouts. The limitation: on the harder Terminal-Bench 2.1 it only matches the baseline, and the 52.1% concentration figure is specific to the profiled Qwen3.5-4B policy.
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.