aspireai.
PUBLIC EDITION

An agent harness that reuses its own settled decisions cut tokens per task 29.5 percent on HumanEval and 87.9 percent on DeepSeek Harness

AspireAI community · arXiv (Jiang, Xu, Gao & Zhao)
Agent harnesses call the model again after every tool result, even when an earlier call already settled the next action. HarnessMM keeps a persistent graph of resolved decisions - the exact action, the literal arguments, the causal dependencies and the guards - and replays them through the native tool interface instead of paying for another reasoning callback, while the actor model's weights stay frozen. The results are measured on complete tasks. On HumanEval, HarnessMM holds Codex success at 90.82 percent while dropping tokens per task from 66.72k to 47.02k, a 29.54 percent saving. On DeepSeek Harness, success rises from 71.43 percent to 85.71 percent while tokens per task fall from 96.28k to 11.62k, an 87.93 percent saving. A separate MBPP ablation measures 26.91 percent lower cost than single-use graphs and 19.52 percent lower cost than retained callbacks. The limitation is scope: the gains are reported on two coding benchmarks and one ablation, and the method only reuses a decision when the stored guard is satisfied - new semantics, unsupported evidence or an abstaining selector send the request back to the original model. https://arxiv.org/abs/2610.32813
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.