Coding agents now ship interactive things such as websites, desktop apps and games, but LLM judges grade them by reading code and running unit tests, so they miss failures a human sees in two seconds. Interaction-as-a-Judge has a computer-use agent actually operate the application and judge it that way, and the authors release 6,858 application pairs with human preferences and matching agent traces plus 222 applications with human-verified requirement labels to support it. Prediction of human preferences rose from 65.6 to 69.1 percent and requirement verification from 77.0 to 81.6 percent over non-interactive grading, and at generation time the approach repaired 75.5 percent of broken requirements within five attempts against 55.4 percent for code-only self-feedback, while training on it as a reward signal improved win-rate by 6.7 points, cut generated code length 35.7 percent and build failures 7.2 percent. The honest caveat: this is a revised version of an October 13 paper, the gains on the two evaluation metrics are single-digit percentage points, and the repair-rate comparison is against code-only feedback rather than a human reviewer.
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.