aspireai.
PUBLIC EDITION

Computer-use agents click on stale screens: 17 percent of clicks planned in the first second after a page opens land on the wrong element

AspireAI community · arXiv
Computer-use agents plan on a screenshot for several seconds and then click a position on the screen. Prior work blamed the planning interval, but measuring planned clicks on 31 public web pages points somewhere else - the risk lives in page loading, not in thinking time. Clicks planned on fully loaded pages went stale within 30 seconds only 0.4% of the time, against 17% for clicks planned in the first second after a page opened. Waiting about one second for network activity to stop removes most of the risk, yet the wait rules in eight of ten widely used open-source agents leave more than 1% of clicks stale. In the HTTP Archive's public crawl, 63% of 3,028 .gov pages went 500 ms without a network request within 3 seconds of their HTML being parsed. The paper also proposes the check itself: a pixel comparison verifies the target's position as accurately as a frontier vision-language model at one eighth of the latency, and a 4B model matches the frontier model on whether the previous action succeeded. The limitation is that 31 pages is a small sample, and the HTTP Archive figures come from crawled pages rather than the agent's own workload.
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.