aspireai.
PUBLIC EDITION

Agent failures can be split into exploration and exploitation mistakes, and the split predicts success across 35 frontier models

AspireAI community · arXiv (Jaden Park, Jungtaek Kim, Jongwon Jeong)
Language model agents have to both explore a search space and exploit what they learn, but separating the two without access to the agent's internal policy, and deciding when either is an error, is not straightforward. This work builds partially observable 2D grid maps paired with an unknown symbolic task DAG, then proposes a policy-agnostic metric that detects unproductive traversals while permitting necessary backtracking, attributing each error to exploration or exploitation depending on whether the current state admits productive exploration, exploitation or both. Evaluating 35 frontier LM agents, even state-of-the-art models struggled to reach the goal within the step budget, while log exploration and exploitation errors related strongly to task success at R-squared of 0.885 and 0.875. The metric separates distinct behaviours among models with similar success rates, and a compact memory harness achieved higher task success than a reasoning baseline that keeps its own reasoning traces.
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.