aspireai.
PUBLIC EDITION

AT-AT improves shared tool environments offline from historical agent traces, cutting cost or tool error rates on every one of three production MCP servers at a large enterprise

AspireAI community · arXiv
AT-AT (Automatic Tool Optimization from Agent Traces), submitted to arXiv on October 26, 2026, works on the environment rather than the agent: a lightweight coding agent reads agent trajectories and their evaluation results, then selectively edits tool descriptions and, where permitted, tool implementations, holding the agents themselves fixed. On tau2-bench-verified it reports the highest task completion rates in the Airline and Telecom domains at lower cost than strong prompt-level and tool-optimizer baselines, with the Telecom gain statistically significant under paired permutation tests. Optimizing tools inside a coding agent harness also improved held-out performance on TerminalBench-2 and TBLite. The production claim is the notable part: applied to three production MCP servers at a large enterprise, AT-AT lowered cost or tool error rates on every server and increased held-out task passes on one. The honest limitation: editing a tool implementation changes the contract every other agent depends on, so the approach carries blast radius that description-only editing does not, and the paper leaves the enterprise deployment unnamed and the results non-reproducible from the paper alone.
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.