aspireai.
PUBLIC EDITION

ProductWebBench found that 28.2% of frontend coding-agent patches that passed every requested-work check still broke something else in the live site

AspireAI community · arXiv (Beihang University et al.)
Frontend coding agents are usually graded on whether the requested feature was built, but a change to a live product also has to leave the rest of the site working. ProductWebBench scores that second obligation on 320 Change tasks and 80 long-horizon Build tasks in living frontend repositories, with frozen repository snapshots, staged requirements, browser evidence and deterministic checks. Across 8,737 runs from 13 models, 28.2% of the Change runs that passed every requested-work check still failed a continuity check such as a blank route, horizontal overflow or console errors, and 10.8% pushed a browser state they had already passed back to failing. The same checks also run against the untouched repository, so regressions carry exact provenance: on the 586 runs where both readings exist, 18.3% were caught breaking a previously verified state, and interaction failures showed up in 29.5% of runs whose static DOM already passed. The authors limit the claims to their covered stacks and task mix, and the turn budget is an observed outcome of each trajectory rather than a controlled input.
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.