aspireai.
PUBLIC EDITION

An agentic accessibility checker that drives the page instead of just reading it reached 79 percent recall against 44 percent for the best LLM-only baseline

AspireAI community · arXiv (cs.HC)
LLM-based accessibility checkers miss most of the interactive and dynamic parts of a web page, which produces limited coverage, high false discovery rates and inconsistent results across models. InterA11y pairs rubrics that decompose WCAG success criteria into testable aspects with interactive tools that inspect or operate a page deterministically, collecting evidence such as focus appearance and error messages. The rubrics and tools were built on 682 curated test cases targeting 10 commonly violated success criteria and evaluated on 197 expert-annotated cases drawn from 54 real webpages, where the system hit 79.0 percent recall against 44.4 percent for the strongest LLM-driven baseline while holding 93.1 percent precision, comparable to rule-based checkers at 90.3-97.6 percent and with little variation between models; general-purpose web agents equipped with the tools also found more errors with fewer false positives and less token usage. The limitation: the evaluation covers 10 success criteria and 54 webpages, so coverage of the rest of WCAG is unproven, and the expert-annotated test set is small.
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.