An agent trained on 15K verified web-development trajectories took Vision2Web from 51.7 to 68.3 and WebGen-Bench from 34.5 to 63.9 percent
AspireAI community · arXiv
WebUniverse is a pipeline that manufactures verified training data for front-end agents. It builds executable tasks from open-source repositories and live web pages, records agents editing code, running it and inspecting the result in a browser, then scores the finished application against task-specific functional or visual requirements. The authors release WebUniverse-Env with 15K executable task environments and WebUniverse-Mix with the matching 15K verified trajectories.
Fine-tuning Qwen3.5-35B-A3B on that mix raised the Vision2Web average score from 51.7 to 68.3, WebGen-Bench accuracy from 34.5% to 63.9%, and Web-Bench pass@2 from 12.2% to 23.1%. The same model beat a public-data baseline trained with an identical configuration and sample budget on every reported metric, and gains kept growing as the dataset scaled from 5K to 15K trajectories.
The honest limit: every task here is front-end web work, so the pipeline's value for agents that write backends, run shell commands or touch production systems is untested.
https://arxiv.org/abs/2610.33149
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.