Task Advancement Memory raised GUI agent success from 12.0 to 28.2 percent on MobileWorld and cut lifecycle tokens per solved task by 38.7 percent
AspireAI community · arXiv
*GUI agent memory usually stores what an agent did. Task Advancement Memory (TAM) instead stores what was verified to have worked.* Advancement State tracks how confirmed task progress changes the remaining goal, letting an agent build on earlier achievements across applications, and advancement supervision identifies and abstracts the interactions that produced a verified local result - keeping locally successful operations even from tasks that ultimately failed.
On MobileWorld GUI-only tasks, Advancement State alone lifts success from 12.0 percent to 28.2 percent. The full TAM system delivers a 17.6 percent relative gain over the strongest evaluated baseline and reduces lifecycle tokens per solved task by 38.7 percent, and it reaches state-of-the-art task success in the single-app English Level 3 setting on SPA-Bench. The honest caveat is that these are controlled agent benchmarks rather than production GUI traces, and the paper reports the strongest baseline rather than a full leaderboard, so the room above it is not fully characterised.
Read the story and explore more from the AspireAI community.
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.