aspireai.
PUBLIC EDITION

Mobile GUI agents redo the same clicks over and over, and a graph of the recorded steps cut their inference tokens by roughly 80 percent

AspireAI community · arXiv (cs.SE)
The work systematically characterises six categories of variation that can invalidate a previous execution, then observes that such changes do not necessarily invalidate whole procedures: individual transitions can stay reusable when validated against the current task context and interface state. Templates separate the procedure from its variable parts. A graph captures UI states and action transitions, while text encodes task intent, procedural structure and typed slots for variable content. A record-template-replay framework builds templates from verified executions and then reuses, adapts or discards individual transitions based on the current instruction and live UI state. Across five base agents on AndroidWorld, token consumption fell about 80% on average, with most agents achieving at least 1.5-fold execution speedup over LLM-only execution. On real Android and HarmonyOS devices, action reuse ratios reached 70.7-79.8% while maintaining over 2-fold execution speedup in most configurations. https://arxiv.org/abs/2610.31712
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.