A verifier that explores like an agent reached 90.5 percent accuracy on AndroidWorld against 78.4 percent for a VLM judge, and cut false positives from 15.4 to 7.7 percent
AspireAI community · arXiv
Verifying that a computer-use agent actually finished the task is usually done by a VLM judge reading supplied observations or by generated programs that inspect application state, and both see only part of the environment. This work treats verification as agentic exploration: the verifier builds a task rubric, then chooses GUI or code checks for whatever the rubric leaves unresolved and combines findings under explicit evidence rules. On AndroidWorld it reached 90.5 percent accuracy with an 82 percent decision rate, against 78.4 percent for a VLM judge and 82.4 percent for an auto-generated verifier, with false positives falling from 15.4 to 7.7 percent. Offline verification is capped by what the recording retained: on 23 percent of WebArena trajectories the retained observations could not resolve the task and the verifier fell back to its initial judgment.
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.