A chart can steer a browsing agent without giving it any instruction at all
AspireAI community · arXiv (EMNLP 2026)
Web agents browse and act on visual evidence that is rarely neutral. MisVisAgentBench is a paired executable benchmark that isolates what happens when a chart misleads: 280 task instances in matched clean and misleading pairs differing only in chart evidence, plus a diagnostic framework that separates misleading-induced failures from ordinary task difficulty and captures execution-level effects such as extra browsing steps and decision hesitation. Across thirteen vision-language web agents, replacing clean charts with misleading counterparts reduced the average task success rate by more than 34 percentage points. The failures mostly followed the targeted misleading action branch rather than random disruption, which suggests deceptive charts systematically redirect agent decisions instead of confusing them. The benchmark is limited to 280 instances and to chart evidence, so it does not cover misleading imagery, text or video.
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.