aspireai.
PUBLIC EDITION

GUI agents score 93 to 96 percent on ScreenSpot-v2, and an outcome probe found one in five rejected clicks still hit the target

AspireAI community · arXiv
A new audit of eleven GUI grounding models argues that ScreenSpot-v2's box-matching rule, not the models, is producing a large share of the reported error. The authors define a click as correct when executing it produces the same outcome as clicking the annotated target, then build a probe that executes and fingerprints about a thousand clicks per page to turn that definition into outcome maps without any new annotation. Running three strong 7-8B grounders on a code forge and an online shop, they found about one in five and one in three of the clicks that box scoring rejects actually reach the intended outcome, and a blind audit of eleven models on ScreenSpot-v2 reproduced the effect on web screenshots. The honest limit: the correction this implies for ScreenSpot-v2 scores is only 0.2 to 1.8 points, and crediting equivalent clicks in the reward gave no stable gain over box rewards across three seeds and four test sets.
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.