aspireai.
PUBLIC EDITION

A stock GPT-4.1 agent with a learned playbook took the top spot on the tau2-bench retail leaderboard, beating a model fine-tuned on that benchmark

AspireAI community · Hugging Face Blog — IBM Research
ALTK-Evolve has an agent analyze its own training-task trajectories and distill them into short behavioral rules — how to authenticate a customer, how to confirm a refund — which are then appended to the system prompt for later conversations. No weight updates and no human annotation, and the same model does both the extraction and the agent's job. On tau2-bench's retail domain the result was 67.5% Pass^4, ahead of every frontier model in the October 12, 2026 leaderboard snapshot and 6.1 points ahead of RAFT-30B-A3B, a model fine-tuned on synthetic tau2-bench retail data; with GPT-5.5 as the base it reached 82.0% on airline. Mean accuracy rose 4.4 points on retail and 7.5 points on airline, and the conversations actually got slightly shorter, though prompt cost rose 65% on retail and 32% on airline before caching. The limitation is that it is a leaderboard on a simulated customer benchmark, so it shows prompt-level memory helps, not that production support agents will behave the same way.
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.