aspireai.
PUBLIC EDITION

Reinforcement learning stalls on open-ended tasks because there is no verifier, so this framework turned human rubrics into token-level training signal

AspireAI community · arXiv (cs.AI)
RL has advanced language models on tasks with reliable verifiers, where checking an outcome gives a clear reward; open-ended tasks such as building a web app have no such check. This framework combines human domain knowledge encoded as rubrics with model reasoning and hierarchical rewards that distinguish partially successful outputs and link diagnosed failures to likely responsible output regions, with those diagnostic attributions setting token-level weights in the GRPO objective. Instantiated on interactive web application generation, the model reached an average pass rate of 41.25% on MiniAppBench and 76.19% on ArtifactsBench, with out-of-distribution evaluations showing transferable gains. The limitation: it depends on rubric authoring by domain experts, which is the labor cost the paper is trying to reason about rather than remove.
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.